<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:dcterms="http://purl.org/dc/terms/"
 xmlns:cc="http://web.resource.org/cc/"
 xmlns:prism="http://prismstandard.org/namespaces/basic/2.0/"
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns:admin="http://webns.net/mvcb/"
 xmlns:content="http://purl.org/rss/1.0/modules/content/">
    <channel rdf:about="https://www.mdpi.com/rss/journal/information">
		<title>Information</title>
		<description>Latest open access articles published in Information at https://www.mdpi.com/journal/information</description>
		<link>https://www.mdpi.com/journal/information</link>
		<admin:generatorAgent rdf:resource="https://www.mdpi.com/journal/information"/>
		<admin:errorReportsTo rdf:resource="mailto:support@mdpi.com"/>
		<dc:publisher>MDPI</dc:publisher>
		<dc:language>en</dc:language>
		<dc:rights>Creative Commons Attribution (CC-BY)</dc:rights>
						<prism:copyright>MDPI</prism:copyright>
		<prism:rightsAgent>support@mdpi.com</prism:rightsAgent>
		<image rdf:resource="https://pub.mdpi-res.com/img/design/mdpi-pub-logo.png?13cf3b5bd783e021?1779970059"/>
				<items>
			<rdf:Seq>
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/533" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/532" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/531" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/530" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/529" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/528" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/527" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/526" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/525" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/524" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/523" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/522" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/521" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/519" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/520" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/518" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/517" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/516" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/515" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/6/513" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/514" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/512" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/511" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/509" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/510" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/508" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/507" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/506" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/505" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/504" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/503" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/501" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/502" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/500" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/499" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/498" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/497" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/496" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/495" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/494" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/493" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/492" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/491" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/490" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/489" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/488" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/487" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/485" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/486" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/484" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/483" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/482" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/481" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/480" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/479" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/478" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/477" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/476" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/475" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/474" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/473" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/472" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/471" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/470" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/469" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/468" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/467" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/466" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/465" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/464" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/463" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/462" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/459" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/461" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/460" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/458" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/457" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/456" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/455" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/454" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/453" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/452" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/451" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/450" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/449" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/448" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/447" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/446" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/445" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/444" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/443" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/442" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/441" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/440" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/439" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/438" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/434" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/437" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/435" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/5/436" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="https://creativecommons.org/licenses/by/4.0/" />
	</channel>

        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/533">

	<title>Information, Vol. 17, Pages 533: Intelligent Diabetes Prediction System Based on Hybrid PSO-GWO Feature Selection and Optimized Machine Learning</title>
	<link>https://www.mdpi.com/2078-2489/17/6/533</link>
	<description>Diabetes mellitus is a highly prevalent chronic disease; early diagnosis reduces severe complications. This work presents a diabetes prediction pipeline that combines metaheuristic feature selection with machine learning classification. We propose a hybrid Particle Swarm Optimization and Grey Wolf Optimizer (PSO-GWO) with alternating collaboration and an adaptive fitness function that adjusts to class balance, sample size, and dimensionality. Selected features are evaluated with random forest (primary), support vector machines, k-nearest neighbors, and logistic regression. The approach is assessed on three clinical datasets (Pima Indians, Frankfurt Hospital, Iraq) using stratified five-fold cross-validation. At the feature selection stage, the hybrid selector reaches 83.36% mean cross-validation accuracy while retaining about 74% of features on average. At the final classification stage, after random forest hyperparameter optimization on the selected features, the optimized random forest achieves 84.74% mean accuracy. Feature count is reduced by about 26% on average without loss of performance, improving interpretability and prospects for clinical use.</description>
	<pubDate>2026-05-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 533: Intelligent Diabetes Prediction System Based on Hybrid PSO-GWO Feature Selection and Optimized Machine Learning</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/533">doi: 10.3390/info17060533</a></p>
	<p>Authors:
		Amine Ziane
		Houda El Bouhissi
		Thomas Hanne
		</p>
	<p>Diabetes mellitus is a highly prevalent chronic disease; early diagnosis reduces severe complications. This work presents a diabetes prediction pipeline that combines metaheuristic feature selection with machine learning classification. We propose a hybrid Particle Swarm Optimization and Grey Wolf Optimizer (PSO-GWO) with alternating collaboration and an adaptive fitness function that adjusts to class balance, sample size, and dimensionality. Selected features are evaluated with random forest (primary), support vector machines, k-nearest neighbors, and logistic regression. The approach is assessed on three clinical datasets (Pima Indians, Frankfurt Hospital, Iraq) using stratified five-fold cross-validation. At the feature selection stage, the hybrid selector reaches 83.36% mean cross-validation accuracy while retaining about 74% of features on average. At the final classification stage, after random forest hyperparameter optimization on the selected features, the optimized random forest achieves 84.74% mean accuracy. Feature count is reduced by about 26% on average without loss of performance, improving interpretability and prospects for clinical use.</p>
	]]></content:encoded>

	<dc:title>Intelligent Diabetes Prediction System Based on Hybrid PSO-GWO Feature Selection and Optimized Machine Learning</dc:title>
			<dc:creator>Amine Ziane</dc:creator>
			<dc:creator>Houda El Bouhissi</dc:creator>
			<dc:creator>Thomas Hanne</dc:creator>
		<dc:identifier>doi: 10.3390/info17060533</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>533</prism:startingPage>
		<prism:doi>10.3390/info17060533</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/533</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/532">

	<title>Information, Vol. 17, Pages 532: Determinants of Patient Adoption of Smartwatches and Mobile Health Applications: An Extended Technology Acceptance Model Study in Saudi Arabia</title>
	<link>https://www.mdpi.com/2078-2489/17/6/532</link>
	<description>The rapid expansion of digital healthcare technologies has accelerated the adoption of smartwatches and mobile health applications; however, empirical evidence explaining patient adoption behavior in rapidly digitalizing healthcare systems such as Saudi Arabia remains limited. This study examines the determinants influencing patients&amp;amp;rsquo; intention to use smartwatches and healthcare mobile applications by applying an extended Technology Acceptance Model (TAM). A cross-sectional survey was conducted among 418 participants with prior experience using wearable or mobile health technologies, and the data were analyzed using structural equation modeling. The results reveal that perceived usefulness, perceived ease of use, social influence, and facilitating conditions significantly and positively influence users&amp;amp;rsquo; attitudes toward digital healthcare technologies, while attitude toward use strongly predicts behavioral intention. The findings extend TAM by demonstrating the combined role of individual perceptions and contextual support factors in shaping digital health adoption in an emerging national digital health ecosystem. These results provide actionable implications for healthcare policymakers, system developers, and service providers seeking to accelerate the adoption of wearable and mobile health technologies and support national digital health transformation initiatives.</description>
	<pubDate>2026-05-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 532: Determinants of Patient Adoption of Smartwatches and Mobile Health Applications: An Extended Technology Acceptance Model Study in Saudi Arabia</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/532">doi: 10.3390/info17060532</a></p>
	<p>Authors:
		Abbas Albarq
		Amal K. Suleiman
		Ahmed Mohamed Hasanein
		Azzam Albutayh
		</p>
	<p>The rapid expansion of digital healthcare technologies has accelerated the adoption of smartwatches and mobile health applications; however, empirical evidence explaining patient adoption behavior in rapidly digitalizing healthcare systems such as Saudi Arabia remains limited. This study examines the determinants influencing patients&amp;amp;rsquo; intention to use smartwatches and healthcare mobile applications by applying an extended Technology Acceptance Model (TAM). A cross-sectional survey was conducted among 418 participants with prior experience using wearable or mobile health technologies, and the data were analyzed using structural equation modeling. The results reveal that perceived usefulness, perceived ease of use, social influence, and facilitating conditions significantly and positively influence users&amp;amp;rsquo; attitudes toward digital healthcare technologies, while attitude toward use strongly predicts behavioral intention. The findings extend TAM by demonstrating the combined role of individual perceptions and contextual support factors in shaping digital health adoption in an emerging national digital health ecosystem. These results provide actionable implications for healthcare policymakers, system developers, and service providers seeking to accelerate the adoption of wearable and mobile health technologies and support national digital health transformation initiatives.</p>
	]]></content:encoded>

	<dc:title>Determinants of Patient Adoption of Smartwatches and Mobile Health Applications: An Extended Technology Acceptance Model Study in Saudi Arabia</dc:title>
			<dc:creator>Abbas Albarq</dc:creator>
			<dc:creator>Amal K. Suleiman</dc:creator>
			<dc:creator>Ahmed Mohamed Hasanein</dc:creator>
			<dc:creator>Azzam Albutayh</dc:creator>
		<dc:identifier>doi: 10.3390/info17060532</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>532</prism:startingPage>
		<prism:doi>10.3390/info17060532</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/532</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/531">

	<title>Information, Vol. 17, Pages 531: Web-Based Repeated Monitoring of Well-Being in University Students: Cohort Protocol and Baseline Findings from the DiCoBENE Study</title>
	<link>https://www.mdpi.com/2078-2489/17/6/531</link>
	<description>Web-based repeated-measures cohorts enable remote, scalable, and temporally structured monitoring of health-related outcomes in naturalistic settings. This paper presents the DiCoBENE study, a web-based cohort of healthcare-track university students, and reports evidence-informed instrument selection together with protocol features and pilot baseline findings. A structured review was used to inform the web-based administration of patient-reported outcome measures (PROMs) covering sleep quality, perceived stress, anxiety symptoms, depressive symptoms, and quality of life. In the pilot baseline sample, 442 students constituted the analytic dataset and 370&amp;amp;ndash;372 completed the core PROM battery, depending on the instrument. Poor sleep quality, anxiety symptoms, depressive symptoms, and perceived stress were common. Internal consistency was good to excellent for the Generalized Anxiety Disorder 7-item scale (GAD-7), the Patient Health Questionnaire 9-item depression module (PHQ-9), and the 10-item Perceived Stress Scale (PSS-10), and moderate for the Pittsburgh Sleep Quality Index (PSQI). Exploratory multivariate analyses, including latent profile analysis, principal component analysis, and partial-correlation network analysis, suggested that baseline heterogeneity was more parsimoniously summarized as a graded multidimensional burden continuum than as sharply separated phenotypes. Taken together, these findings position DiCoBENE as a methodologically explicit framework for web-based repeated outcome assessment in student well-being research.</description>
	<pubDate>2026-05-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 531: Web-Based Repeated Monitoring of Well-Being in University Students: Cohort Protocol and Baseline Findings from the DiCoBENE Study</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/531">doi: 10.3390/info17060531</a></p>
	<p>Authors:
		Andrea Maugeri
		Martina Barchitta
		Antonella Agodi
		</p>
	<p>Web-based repeated-measures cohorts enable remote, scalable, and temporally structured monitoring of health-related outcomes in naturalistic settings. This paper presents the DiCoBENE study, a web-based cohort of healthcare-track university students, and reports evidence-informed instrument selection together with protocol features and pilot baseline findings. A structured review was used to inform the web-based administration of patient-reported outcome measures (PROMs) covering sleep quality, perceived stress, anxiety symptoms, depressive symptoms, and quality of life. In the pilot baseline sample, 442 students constituted the analytic dataset and 370&amp;amp;ndash;372 completed the core PROM battery, depending on the instrument. Poor sleep quality, anxiety symptoms, depressive symptoms, and perceived stress were common. Internal consistency was good to excellent for the Generalized Anxiety Disorder 7-item scale (GAD-7), the Patient Health Questionnaire 9-item depression module (PHQ-9), and the 10-item Perceived Stress Scale (PSS-10), and moderate for the Pittsburgh Sleep Quality Index (PSQI). Exploratory multivariate analyses, including latent profile analysis, principal component analysis, and partial-correlation network analysis, suggested that baseline heterogeneity was more parsimoniously summarized as a graded multidimensional burden continuum than as sharply separated phenotypes. Taken together, these findings position DiCoBENE as a methodologically explicit framework for web-based repeated outcome assessment in student well-being research.</p>
	]]></content:encoded>

	<dc:title>Web-Based Repeated Monitoring of Well-Being in University Students: Cohort Protocol and Baseline Findings from the DiCoBENE Study</dc:title>
			<dc:creator>Andrea Maugeri</dc:creator>
			<dc:creator>Martina Barchitta</dc:creator>
			<dc:creator>Antonella Agodi</dc:creator>
		<dc:identifier>doi: 10.3390/info17060531</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>531</prism:startingPage>
		<prism:doi>10.3390/info17060531</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/531</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/530">

	<title>Information, Vol. 17, Pages 530: From Screen to Scene: How Virtual Experiences Translate into Actual Destination Visits</title>
	<link>https://www.mdpi.com/2078-2489/17/6/530</link>
	<description>While virtual tourism (VT) has emerged as a disruptive force in destination marketing, the mechanism by which virtual immersion translates into physical visitation remains debated. Addressing the &amp;amp;ldquo;virtual-to-real&amp;amp;rdquo; conversion gap, this study proposes an integrated theoretical framework combining the Stimulus&amp;amp;ndash;Organism&amp;amp;ndash;Response (SOR) model with the Technology Acceptance Model (TAM). Unlike traditional studies, we position Perceived Usefulness (PU) and Perceived Ease of Use (PEOU) as boundary conditions rather than direct antecedents. Empirical data were collected from 476 tourists with virtual experiences of Zhangjiajie National Forest Park and analyzed using Structural Equation Modeling (SEM). The results indicate that virtual experiences not only directly trigger visit intention but also indirectly foster it by enhancing destination attitude. Crucially, a novel &amp;amp;ldquo;asymmetric moderation&amp;amp;rdquo; effect was revealed: while technical attributes (PU and PEOU) do not influence the affective formation of attitude, they significantly moderate the translation of attitude and experience into behavioral intention. These findings suggest that while immersion drives &amp;amp;ldquo;liking,&amp;amp;rdquo; technical utility drives &amp;amp;ldquo;going.&amp;amp;rdquo; This study offers strategic insights for Destination Marketing Organizations (DMOs) to optimize VT platforms by balancing hedonic experience with functional utility to maximize actual visitor conversion.</description>
	<pubDate>2026-05-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 530: From Screen to Scene: How Virtual Experiences Translate into Actual Destination Visits</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/530">doi: 10.3390/info17060530</a></p>
	<p>Authors:
		Dan-Yang Yi
		Xiao-Dong Sun
		Jun-Hui Wang
		</p>
	<p>While virtual tourism (VT) has emerged as a disruptive force in destination marketing, the mechanism by which virtual immersion translates into physical visitation remains debated. Addressing the &amp;amp;ldquo;virtual-to-real&amp;amp;rdquo; conversion gap, this study proposes an integrated theoretical framework combining the Stimulus&amp;amp;ndash;Organism&amp;amp;ndash;Response (SOR) model with the Technology Acceptance Model (TAM). Unlike traditional studies, we position Perceived Usefulness (PU) and Perceived Ease of Use (PEOU) as boundary conditions rather than direct antecedents. Empirical data were collected from 476 tourists with virtual experiences of Zhangjiajie National Forest Park and analyzed using Structural Equation Modeling (SEM). The results indicate that virtual experiences not only directly trigger visit intention but also indirectly foster it by enhancing destination attitude. Crucially, a novel &amp;amp;ldquo;asymmetric moderation&amp;amp;rdquo; effect was revealed: while technical attributes (PU and PEOU) do not influence the affective formation of attitude, they significantly moderate the translation of attitude and experience into behavioral intention. These findings suggest that while immersion drives &amp;amp;ldquo;liking,&amp;amp;rdquo; technical utility drives &amp;amp;ldquo;going.&amp;amp;rdquo; This study offers strategic insights for Destination Marketing Organizations (DMOs) to optimize VT platforms by balancing hedonic experience with functional utility to maximize actual visitor conversion.</p>
	]]></content:encoded>

	<dc:title>From Screen to Scene: How Virtual Experiences Translate into Actual Destination Visits</dc:title>
			<dc:creator>Dan-Yang Yi</dc:creator>
			<dc:creator>Xiao-Dong Sun</dc:creator>
			<dc:creator>Jun-Hui Wang</dc:creator>
		<dc:identifier>doi: 10.3390/info17060530</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-28</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-28</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>530</prism:startingPage>
		<prism:doi>10.3390/info17060530</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/530</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/529">

	<title>Information, Vol. 17, Pages 529: An Automated Information Processing Framework for UAV-Based Detection and Spatial Mapping of Crop Damage Using Deep Learning</title>
	<link>https://www.mdpi.com/2078-2489/17/6/529</link>
	<description>The early detection and spatial characterization of crop damage are critical for improving decision-making in precision agriculture, particularly in regions where traditional monitoring methods are limited in scalability and objectivity. This study presents an integrated information processing framework that couples UAV-based image acquisition, instance segmentation, slicing-aided inference of large orthomosaics, and georeferenced spatial analysis into a single reproducible pipeline for the detection and mapping of crop damage. The framework is applied to maize cultivated under traditional milpa systems in Yucat&amp;amp;aacute;n, Mexico, a region characterized by intercropping, irregular plant spacing, and complex backgrounds rarely represented in mainstream agricultural deep learning benchmarks. High-resolution RGB images were systematically acquired over maize fields in Yucat&amp;amp;aacute;n, Mexico, and curated into specialized datasets representing parcels, individual plants, and damaged vegetation. Instance segmentation models based on the YOLOv11 architecture were trained and evaluated to extract visual information related to crop condition, while the Slicing-Aided Hyper Inference (SAHI) method was integrated to enable efficient processing of large orthomosaic images. The proposed framework achieved high performance in detecting maize plants, with a precision of 92.9% and an mAP50 of 94.2%, and demonstrated reliable identification of damage patterns associated with Spodoptera frugiperda, reaching a precision of 79.2% and an mAP50 of 71.7%. The resulting georeferenced outputs provide spatially explicit information that supports quantitative analysis of crop health and damage distribution. The results indicate that the proposed framework constitutes a scalable and reproducible approach for UAV-based visual information extraction, with potential applicability to broader agricultural monitoring and data-driven decision support systems.</description>
	<pubDate>2026-05-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 529: An Automated Information Processing Framework for UAV-Based Detection and Spatial Mapping of Crop Damage Using Deep Learning</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/529">doi: 10.3390/info17060529</a></p>
	<p>Authors:
		Alejandro Carrillo-Gómez
		Daniela Moctezuma
		Enrique Camacho-Pérez
		</p>
	<p>The early detection and spatial characterization of crop damage are critical for improving decision-making in precision agriculture, particularly in regions where traditional monitoring methods are limited in scalability and objectivity. This study presents an integrated information processing framework that couples UAV-based image acquisition, instance segmentation, slicing-aided inference of large orthomosaics, and georeferenced spatial analysis into a single reproducible pipeline for the detection and mapping of crop damage. The framework is applied to maize cultivated under traditional milpa systems in Yucat&amp;amp;aacute;n, Mexico, a region characterized by intercropping, irregular plant spacing, and complex backgrounds rarely represented in mainstream agricultural deep learning benchmarks. High-resolution RGB images were systematically acquired over maize fields in Yucat&amp;amp;aacute;n, Mexico, and curated into specialized datasets representing parcels, individual plants, and damaged vegetation. Instance segmentation models based on the YOLOv11 architecture were trained and evaluated to extract visual information related to crop condition, while the Slicing-Aided Hyper Inference (SAHI) method was integrated to enable efficient processing of large orthomosaic images. The proposed framework achieved high performance in detecting maize plants, with a precision of 92.9% and an mAP50 of 94.2%, and demonstrated reliable identification of damage patterns associated with Spodoptera frugiperda, reaching a precision of 79.2% and an mAP50 of 71.7%. The resulting georeferenced outputs provide spatially explicit information that supports quantitative analysis of crop health and damage distribution. The results indicate that the proposed framework constitutes a scalable and reproducible approach for UAV-based visual information extraction, with potential applicability to broader agricultural monitoring and data-driven decision support systems.</p>
	]]></content:encoded>

	<dc:title>An Automated Information Processing Framework for UAV-Based Detection and Spatial Mapping of Crop Damage Using Deep Learning</dc:title>
			<dc:creator>Alejandro Carrillo-Gómez</dc:creator>
			<dc:creator>Daniela Moctezuma</dc:creator>
			<dc:creator>Enrique Camacho-Pérez</dc:creator>
		<dc:identifier>doi: 10.3390/info17060529</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-27</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-27</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>529</prism:startingPage>
		<prism:doi>10.3390/info17060529</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/529</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/528">

	<title>Information, Vol. 17, Pages 528: A New Lossless Compression Paradigm for Federated Learning: A Quantile-Based Framework for Bandwidth Efficiency Without Accuracy Degradation</title>
	<link>https://www.mdpi.com/2078-2489/17/6/528</link>
	<description>Federated Learning (FL) is a machine learning technique that preserves data privacy and security by training models directly on decentralized edge network devices. This generates substantial communication overhead due to the repeated exchange of model updates across numerous edge network devices. Quantization has tackled this challenge by reducing communication overhead and computational costs by quantizing model updates. Although selecting the most suitable quantization level to balance communication efficiency and model accuracy is challenging, failing to achieve this balance results in excessive compression, leading to accuracy degradation due to the lossy nature of the quantization technique. This challenge was tackled in this paper via a Quantile-based lossless compression method named Pcodec, which implements lossless compression in the FL context. Pcodec is a Quantile-based lossless compression algorithm designed for numerical data that utilizes mode identification with delta encoding and binning, where binning groups similar values into entropy-coded bins and stores the exact offset within each bin, thus achieving high compression ratios and efficient processing speed. Using MNIST and CIFAR-10 datasets and models such as CNN and ResNet18, we demonstrate that Pcodec achieves up to 58.19% size reduction with no accuracy loss compared to standard quantization methods. The experiments showed that the proposed Quantile-based compression approach in FL reduces up to 2.81&amp;amp;times; the communication overhead between each server and edge network device while maintaining the accuracy. In comparison to quantization, the Quantile approach reduced the communication overhead by 2.74&amp;amp;times;, tackling the main challenge of FL context by reducing communication overhead with a remarkably high compression ratio while maintaining the model&amp;amp;rsquo;s accuracy.</description>
	<pubDate>2026-05-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 528: A New Lossless Compression Paradigm for Federated Learning: A Quantile-Based Framework for Bandwidth Efficiency Without Accuracy Degradation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/528">doi: 10.3390/info17060528</a></p>
	<p>Authors:
		Marwa Abdellah
		Aya Hesham
		Ahmad Salah
		Gamal M. Behery
		</p>
	<p>Federated Learning (FL) is a machine learning technique that preserves data privacy and security by training models directly on decentralized edge network devices. This generates substantial communication overhead due to the repeated exchange of model updates across numerous edge network devices. Quantization has tackled this challenge by reducing communication overhead and computational costs by quantizing model updates. Although selecting the most suitable quantization level to balance communication efficiency and model accuracy is challenging, failing to achieve this balance results in excessive compression, leading to accuracy degradation due to the lossy nature of the quantization technique. This challenge was tackled in this paper via a Quantile-based lossless compression method named Pcodec, which implements lossless compression in the FL context. Pcodec is a Quantile-based lossless compression algorithm designed for numerical data that utilizes mode identification with delta encoding and binning, where binning groups similar values into entropy-coded bins and stores the exact offset within each bin, thus achieving high compression ratios and efficient processing speed. Using MNIST and CIFAR-10 datasets and models such as CNN and ResNet18, we demonstrate that Pcodec achieves up to 58.19% size reduction with no accuracy loss compared to standard quantization methods. The experiments showed that the proposed Quantile-based compression approach in FL reduces up to 2.81&amp;amp;times; the communication overhead between each server and edge network device while maintaining the accuracy. In comparison to quantization, the Quantile approach reduced the communication overhead by 2.74&amp;amp;times;, tackling the main challenge of FL context by reducing communication overhead with a remarkably high compression ratio while maintaining the model&amp;amp;rsquo;s accuracy.</p>
	]]></content:encoded>

	<dc:title>A New Lossless Compression Paradigm for Federated Learning: A Quantile-Based Framework for Bandwidth Efficiency Without Accuracy Degradation</dc:title>
			<dc:creator>Marwa Abdellah</dc:creator>
			<dc:creator>Aya Hesham</dc:creator>
			<dc:creator>Ahmad Salah</dc:creator>
			<dc:creator>Gamal M. Behery</dc:creator>
		<dc:identifier>doi: 10.3390/info17060528</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-26</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-26</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>528</prism:startingPage>
		<prism:doi>10.3390/info17060528</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/528</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/527">

	<title>Information, Vol. 17, Pages 527: GADD: Game-Inspired Adversarial Distillation for Robust Graph Defense</title>
	<link>https://www.mdpi.com/2078-2489/17/6/527</link>
	<description>Graph neural networks (GNNs) are highly effective on relational data, yet their performance degrades sharply when graph topology is poisoned before training. Existing defenses usually assume a fixed attack pattern and a fixed graph structure, which makes them brittle when the poisoned graph changes across attacks, perturbation budgets, or deployment conditions. We propose GADD, a game-inspired adversarial distillation framework for robust graph defense. GADD first constructs multiple positive and negative graph views through a homophily-aware graph sampling scheme, allowing the model to learn from both purified and high-risk subgraphs. It then trains a heterogeneous group of student GNNs online, where each student receives global class-distribution knowledge from its peers and local structural knowledge through an adversarial cyclic distillation objective. Finally, GADD replaces uniform ensembling with an entropy-regularized adaptive aggregation rule that assigns graph-adaptive weights according to confidence and inter-model agreement. On Cora, CiteSeer, and PubMed, GADD consistently improves robustness against both Meta and Nettack attacks while preserving clean accuracy. Under the strongest Meta and Nettack settings in the main benchmark, GADD improves the best competing baseline by up to 2.99 and 3.42 percentage points, respectively. Additional ablations show that graph sampling, adversarial distillation, and adaptive aggregation all contribute materially to the final robustness gains.</description>
	<pubDate>2026-05-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 527: GADD: Game-Inspired Adversarial Distillation for Robust Graph Defense</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/527">doi: 10.3390/info17060527</a></p>
	<p>Authors:
		Yabin Peng
		Chenyu Zhou
		Yuchen Liu
		Kunlin Li
		Fan Zhang
		Shaoxun Liu
		</p>
	<p>Graph neural networks (GNNs) are highly effective on relational data, yet their performance degrades sharply when graph topology is poisoned before training. Existing defenses usually assume a fixed attack pattern and a fixed graph structure, which makes them brittle when the poisoned graph changes across attacks, perturbation budgets, or deployment conditions. We propose GADD, a game-inspired adversarial distillation framework for robust graph defense. GADD first constructs multiple positive and negative graph views through a homophily-aware graph sampling scheme, allowing the model to learn from both purified and high-risk subgraphs. It then trains a heterogeneous group of student GNNs online, where each student receives global class-distribution knowledge from its peers and local structural knowledge through an adversarial cyclic distillation objective. Finally, GADD replaces uniform ensembling with an entropy-regularized adaptive aggregation rule that assigns graph-adaptive weights according to confidence and inter-model agreement. On Cora, CiteSeer, and PubMed, GADD consistently improves robustness against both Meta and Nettack attacks while preserving clean accuracy. Under the strongest Meta and Nettack settings in the main benchmark, GADD improves the best competing baseline by up to 2.99 and 3.42 percentage points, respectively. Additional ablations show that graph sampling, adversarial distillation, and adaptive aggregation all contribute materially to the final robustness gains.</p>
	]]></content:encoded>

	<dc:title>GADD: Game-Inspired Adversarial Distillation for Robust Graph Defense</dc:title>
			<dc:creator>Yabin Peng</dc:creator>
			<dc:creator>Chenyu Zhou</dc:creator>
			<dc:creator>Yuchen Liu</dc:creator>
			<dc:creator>Kunlin Li</dc:creator>
			<dc:creator>Fan Zhang</dc:creator>
			<dc:creator>Shaoxun Liu</dc:creator>
		<dc:identifier>doi: 10.3390/info17060527</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-26</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-26</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>527</prism:startingPage>
		<prism:doi>10.3390/info17060527</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/527</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/526">

	<title>Information, Vol. 17, Pages 526: Multi-Scale Wavelet-Enhanced U-Mamba Network for Image Forgery Localization</title>
	<link>https://www.mdpi.com/2078-2489/17/6/526</link>
	<description>The widespread availability of image editing tools and generative AI has made image forgery more accessible and deceptive, demanding more advanced localization techniques. Existing CNN-based methods are limited by local receptive fields, struggling with long-range dependencies, while Transformers suffer from the quadratic complexity of self-attention, hindering practical deployment. Moreover, effectively utilizing multi-scale features remains challenging. To address these challenges, we propose a Multi-scale Wavelet-enhanced U-Mamba network (MWEU-Mamba). The proposed framework employs a Mamba-based state space model as the backbone to achieve global contextual modeling with linear complexity. A wavelet enhancement module is introduced to integrate spatial&amp;amp;ndash;frequency representations, improving sensitivity to subtle manipulation traces across scales, while a channel attention mechanism further amplifies forgery-relevant feature responses. Extensive experiments on six public benchmark datasets (e.g., CASIA and Coverage) demonstrate that the proposed method achieves state-of-the-art performance on multiple datasets in terms of pixel-level F1-score.</description>
	<pubDate>2026-05-26</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 526: Multi-Scale Wavelet-Enhanced U-Mamba Network for Image Forgery Localization</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/526">doi: 10.3390/info17060526</a></p>
	<p>Authors:
		Bing Qi
		Chunyang Ye
		Yuliang Ding
		</p>
	<p>The widespread availability of image editing tools and generative AI has made image forgery more accessible and deceptive, demanding more advanced localization techniques. Existing CNN-based methods are limited by local receptive fields, struggling with long-range dependencies, while Transformers suffer from the quadratic complexity of self-attention, hindering practical deployment. Moreover, effectively utilizing multi-scale features remains challenging. To address these challenges, we propose a Multi-scale Wavelet-enhanced U-Mamba network (MWEU-Mamba). The proposed framework employs a Mamba-based state space model as the backbone to achieve global contextual modeling with linear complexity. A wavelet enhancement module is introduced to integrate spatial&amp;amp;ndash;frequency representations, improving sensitivity to subtle manipulation traces across scales, while a channel attention mechanism further amplifies forgery-relevant feature responses. Extensive experiments on six public benchmark datasets (e.g., CASIA and Coverage) demonstrate that the proposed method achieves state-of-the-art performance on multiple datasets in terms of pixel-level F1-score.</p>
	]]></content:encoded>

	<dc:title>Multi-Scale Wavelet-Enhanced U-Mamba Network for Image Forgery Localization</dc:title>
			<dc:creator>Bing Qi</dc:creator>
			<dc:creator>Chunyang Ye</dc:creator>
			<dc:creator>Yuliang Ding</dc:creator>
		<dc:identifier>doi: 10.3390/info17060526</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-26</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-26</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>526</prism:startingPage>
		<prism:doi>10.3390/info17060526</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/526</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/525">

	<title>Information, Vol. 17, Pages 525: Analysis of a Modified Hyperledger Fabric Blockchain Architecture for GDPR-Compliant Identity and Access Management</title>
	<link>https://www.mdpi.com/2078-2489/17/6/525</link>
	<description>Background: Conventional blockchain ledgers are immutable by design, which conflicts with the right to erasure mandated by the European Union General Data Protection Regulation (GDPR, Article 17), particularly for identity and access management (IAM) workloads that store personal data on-chain. Methods: We integrated the National Institute of Standards and Technology (NIST) data block matrix (DBM) into Hyperledger Fabric, developed an IAM chaincode with erasure-aware role-based and attribute-based access control, formally modeled the deletion protocol in TLA+ at a bounded scope (up to 4 organizations, 3 assets, quorum =3), and evaluated the design on a local 3-VM testbed and a 20-organization cross-region Google Kubernetes Engine (GKE) deployment. Results: Hash-operation counts from 102 to 106 blocks track the theoretical O(N) bound; chaincode-level throughput reaches 78&amp;amp;ndash;102 TPS for individual operations and 1967&amp;amp;ndash;2465 TPS for batch writes, with a 305 TPS sustained measurement across 20 organizations over an 80&amp;amp;ndash;100 ms cross-region link. Conclusions: The design supports technical alignment with GDPR Article 17 for on-chain data, but a deterministic timing oracle on the deletion reject path and a rate-limiter gap on the request path remain open; these are disclosed as scope limitations and prioritized for structural mitigation in future work.</description>
	<pubDate>2026-05-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 525: Analysis of a Modified Hyperledger Fabric Blockchain Architecture for GDPR-Compliant Identity and Access Management</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/525">doi: 10.3390/info17060525</a></p>
	<p>Authors:
		Alex Bulzan
		Robert Botez
		Virgil Dobrota
		</p>
	<p>Background: Conventional blockchain ledgers are immutable by design, which conflicts with the right to erasure mandated by the European Union General Data Protection Regulation (GDPR, Article 17), particularly for identity and access management (IAM) workloads that store personal data on-chain. Methods: We integrated the National Institute of Standards and Technology (NIST) data block matrix (DBM) into Hyperledger Fabric, developed an IAM chaincode with erasure-aware role-based and attribute-based access control, formally modeled the deletion protocol in TLA+ at a bounded scope (up to 4 organizations, 3 assets, quorum =3), and evaluated the design on a local 3-VM testbed and a 20-organization cross-region Google Kubernetes Engine (GKE) deployment. Results: Hash-operation counts from 102 to 106 blocks track the theoretical O(N) bound; chaincode-level throughput reaches 78&amp;amp;ndash;102 TPS for individual operations and 1967&amp;amp;ndash;2465 TPS for batch writes, with a 305 TPS sustained measurement across 20 organizations over an 80&amp;amp;ndash;100 ms cross-region link. Conclusions: The design supports technical alignment with GDPR Article 17 for on-chain data, but a deterministic timing oracle on the deletion reject path and a rate-limiter gap on the request path remain open; these are disclosed as scope limitations and prioritized for structural mitigation in future work.</p>
	]]></content:encoded>

	<dc:title>Analysis of a Modified Hyperledger Fabric Blockchain Architecture for GDPR-Compliant Identity and Access Management</dc:title>
			<dc:creator>Alex Bulzan</dc:creator>
			<dc:creator>Robert Botez</dc:creator>
			<dc:creator>Virgil Dobrota</dc:creator>
		<dc:identifier>doi: 10.3390/info17060525</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-25</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-25</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>525</prism:startingPage>
		<prism:doi>10.3390/info17060525</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/525</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/524">

	<title>Information, Vol. 17, Pages 524: Electronic Health Literacy Content Is Scarce and Underperforming on TikTok: An Exploratory Analysis</title>
	<link>https://www.mdpi.com/2078-2489/17/6/524</link>
	<description>Most TikTok users have low electronic health (eHealth) literacy. Yet, evidence on the availability, content, and engagement metrics of TikTok videos on eHealth literacy is scanty. This study analyzes the content and engagement metrics of recent TikTok videos on health literacy to identify the unmet eHealth literacy needs of TikTok users. A convergent mixed-methods study was conducted. The hashtag #eHealthliteracy was searched for videos published between January 2025 and February 2026. Engagement and content data were retrieved and analyzed statistically and thematically, respectively. Sixty of the 69 retrieved TikTok videos were shorter than 288 s. Favorite:like ratio was the only high engagement ratio at 15%; the rest were less than 4%. Only four of the 69 videos were generated using artificial intelligence, and their engagement metrics were the highest. Video lengths were negatively associated with all engagement metrics (&amp;amp;beta; = &amp;amp;minus;0.004 to &amp;amp;minus;0.008, p &amp;amp;lt; 0.001). Favorites, shares, and likes were significantly higher for educational videos compared to promotional videos (p = 0.0071, 0.0252, and 0.0413), with medium effect sizes of &amp;amp;epsilon;2 = 0.1072, 0.0743, and 0.0617, respectively. Only six of the 69 videos were directly on eHealth literacy; the rest were on health literacy. The increasing availability of health information is not accompanied by eHealth literacy on TikTok. Future eHealth literacy videos should be short, institutional, AI-optimized, and embedded with health topics for better reach and engagement.</description>
	<pubDate>2026-05-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 524: Electronic Health Literacy Content Is Scarce and Underperforming on TikTok: An Exploratory Analysis</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/524">doi: 10.3390/info17060524</a></p>
	<p>Authors:
		Elham Aldousari
		</p>
	<p>Most TikTok users have low electronic health (eHealth) literacy. Yet, evidence on the availability, content, and engagement metrics of TikTok videos on eHealth literacy is scanty. This study analyzes the content and engagement metrics of recent TikTok videos on health literacy to identify the unmet eHealth literacy needs of TikTok users. A convergent mixed-methods study was conducted. The hashtag #eHealthliteracy was searched for videos published between January 2025 and February 2026. Engagement and content data were retrieved and analyzed statistically and thematically, respectively. Sixty of the 69 retrieved TikTok videos were shorter than 288 s. Favorite:like ratio was the only high engagement ratio at 15%; the rest were less than 4%. Only four of the 69 videos were generated using artificial intelligence, and their engagement metrics were the highest. Video lengths were negatively associated with all engagement metrics (&amp;amp;beta; = &amp;amp;minus;0.004 to &amp;amp;minus;0.008, p &amp;amp;lt; 0.001). Favorites, shares, and likes were significantly higher for educational videos compared to promotional videos (p = 0.0071, 0.0252, and 0.0413), with medium effect sizes of &amp;amp;epsilon;2 = 0.1072, 0.0743, and 0.0617, respectively. Only six of the 69 videos were directly on eHealth literacy; the rest were on health literacy. The increasing availability of health information is not accompanied by eHealth literacy on TikTok. Future eHealth literacy videos should be short, institutional, AI-optimized, and embedded with health topics for better reach and engagement.</p>
	]]></content:encoded>

	<dc:title>Electronic Health Literacy Content Is Scarce and Underperforming on TikTok: An Exploratory Analysis</dc:title>
			<dc:creator>Elham Aldousari</dc:creator>
		<dc:identifier>doi: 10.3390/info17060524</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-25</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-25</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>524</prism:startingPage>
		<prism:doi>10.3390/info17060524</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/524</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/523">

	<title>Information, Vol. 17, Pages 523: Alarm Prediction in Predictive Maintenance: A Comparative Analysis of Temporal Windows for Machine Learning Models in Industrial Systems</title>
	<link>https://www.mdpi.com/2078-2489/17/6/523</link>
	<description>Predictive maintenance (PdM) plays a key role in improving the reliability and efficiency of industrial systems by anticipating abnormal operating conditions through data-driven approaches. In this context, many PdM solutions rely on temporal windowing strategies applied to multivariate time series; however, the choice of observation and prediction horizons is often fixed a priori and rarely analyzed in a systematic way. This paper investigates the impact of temporal window design by formulating alarm prediction as a window-based classification problem, explicitly distinguishing between the observation horizon and the prediction horizon. A comprehensive experimental study is conducted on three real-world industrial datasets characterized by different process dynamics. Multiple machine learning and deep learning models are evaluated across a wide range of combinations of observation and prediction horizons. The results show that predictive performance is strongly influenced by the joint configuration of observation and prediction horizons, rather than by their individual selection. While increasing the prediction horizon generally reduces accuracy, the magnitude of this effect depends on system dynamics. Similarly, longer observation horizons substantially improve performance in processes with slow dynamics, while providing limited benefits in faster-evolving systems. Overall, the study highlights the importance of explicitly modeling temporal window parameters in predictive maintenance design, providing both methodological insights and practical guidelines for selecting appropriate temporal configurations in industrial alarm prediction tasks.</description>
	<pubDate>2026-05-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 523: Alarm Prediction in Predictive Maintenance: A Comparative Analysis of Temporal Windows for Machine Learning Models in Industrial Systems</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/523">doi: 10.3390/info17060523</a></p>
	<p>Authors:
		Mario Caterino
		Tammaro Ucciero
		Riccardo Emanuele Landi
		Luca Mozzillo
		Antonio Negro
		Federico Saponaro
		Domenico Soriano
		Ivo Surano
		Salvatore Miranda
		Roberto Macchiaroli
		Marcello Fera
		</p>
	<p>Predictive maintenance (PdM) plays a key role in improving the reliability and efficiency of industrial systems by anticipating abnormal operating conditions through data-driven approaches. In this context, many PdM solutions rely on temporal windowing strategies applied to multivariate time series; however, the choice of observation and prediction horizons is often fixed a priori and rarely analyzed in a systematic way. This paper investigates the impact of temporal window design by formulating alarm prediction as a window-based classification problem, explicitly distinguishing between the observation horizon and the prediction horizon. A comprehensive experimental study is conducted on three real-world industrial datasets characterized by different process dynamics. Multiple machine learning and deep learning models are evaluated across a wide range of combinations of observation and prediction horizons. The results show that predictive performance is strongly influenced by the joint configuration of observation and prediction horizons, rather than by their individual selection. While increasing the prediction horizon generally reduces accuracy, the magnitude of this effect depends on system dynamics. Similarly, longer observation horizons substantially improve performance in processes with slow dynamics, while providing limited benefits in faster-evolving systems. Overall, the study highlights the importance of explicitly modeling temporal window parameters in predictive maintenance design, providing both methodological insights and practical guidelines for selecting appropriate temporal configurations in industrial alarm prediction tasks.</p>
	]]></content:encoded>

	<dc:title>Alarm Prediction in Predictive Maintenance: A Comparative Analysis of Temporal Windows for Machine Learning Models in Industrial Systems</dc:title>
			<dc:creator>Mario Caterino</dc:creator>
			<dc:creator>Tammaro Ucciero</dc:creator>
			<dc:creator>Riccardo Emanuele Landi</dc:creator>
			<dc:creator>Luca Mozzillo</dc:creator>
			<dc:creator>Antonio Negro</dc:creator>
			<dc:creator>Federico Saponaro</dc:creator>
			<dc:creator>Domenico Soriano</dc:creator>
			<dc:creator>Ivo Surano</dc:creator>
			<dc:creator>Salvatore Miranda</dc:creator>
			<dc:creator>Roberto Macchiaroli</dc:creator>
			<dc:creator>Marcello Fera</dc:creator>
		<dc:identifier>doi: 10.3390/info17060523</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-25</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-25</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>523</prism:startingPage>
		<prism:doi>10.3390/info17060523</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/523</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/522">

	<title>Information, Vol. 17, Pages 522: Electromagnetic Diagnostic Techniques for the Conservation of Modern Oil Paintings: A Review</title>
	<link>https://www.mdpi.com/2078-2489/17/6/522</link>
	<description>Modern oil paintings are characterized by the extensive use of industrial pigments, synthetic binders, and chemical additives introduced during the late nineteenth and twentieth centuries. While these innovations enabled significant artistic experimentation, they also introduced new conservation challenges due to the chemical instability of many modern paint formulations. As a consequence, modern oil paintings frequently exhibit degradation phenomena such as efflorescence, yellowing, blistering, peeling and cracking, and high sensitivity to water and organic solvents. A comprehensive understanding of the materials used in modern oil paintings&amp;amp;mdash;including pigments, binders, and additives&amp;amp;mdash;is therefore essential for developing effective conservation strategies. In this context, electromagnetic (EM) diagnostic techniques represent powerful tools for the noninvasive or minimally invasive investigation of artworks. These techniques allow researchers to characterize the chemical composition, morphology, and degradation processes affecting paint layers and substrates. This paper provides an overview of the EM techniques most commonly used in the conservation of modern oil paintings. Particular attention is devoted to spectroscopic and imaging methods such as scanning electron microscopy with energy-dispersive X-ray spectroscopy (SEM-EDX), Fourier-transform infrared (FTIR) spectroscopy, Raman spectroscopy, UV-Vis spectroscopy, and X-ray-based techniques, as well as to the laser technique for the delicate cleaning process. Through selected case studies reported in the literature, this review highlights the role of these techniques in pigment identification, degradation analysis, and the development of more effective conservation strategies for modern oil paintings.</description>
	<pubDate>2026-05-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 522: Electromagnetic Diagnostic Techniques for the Conservation of Modern Oil Paintings: A Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/522">doi: 10.3390/info17060522</a></p>
	<p>Authors:
		Patrizia Piersigilli
		Rocco Citroni
		Fabio Mangini
		Fabrizio Frezza
		</p>
	<p>Modern oil paintings are characterized by the extensive use of industrial pigments, synthetic binders, and chemical additives introduced during the late nineteenth and twentieth centuries. While these innovations enabled significant artistic experimentation, they also introduced new conservation challenges due to the chemical instability of many modern paint formulations. As a consequence, modern oil paintings frequently exhibit degradation phenomena such as efflorescence, yellowing, blistering, peeling and cracking, and high sensitivity to water and organic solvents. A comprehensive understanding of the materials used in modern oil paintings&amp;amp;mdash;including pigments, binders, and additives&amp;amp;mdash;is therefore essential for developing effective conservation strategies. In this context, electromagnetic (EM) diagnostic techniques represent powerful tools for the noninvasive or minimally invasive investigation of artworks. These techniques allow researchers to characterize the chemical composition, morphology, and degradation processes affecting paint layers and substrates. This paper provides an overview of the EM techniques most commonly used in the conservation of modern oil paintings. Particular attention is devoted to spectroscopic and imaging methods such as scanning electron microscopy with energy-dispersive X-ray spectroscopy (SEM-EDX), Fourier-transform infrared (FTIR) spectroscopy, Raman spectroscopy, UV-Vis spectroscopy, and X-ray-based techniques, as well as to the laser technique for the delicate cleaning process. Through selected case studies reported in the literature, this review highlights the role of these techniques in pigment identification, degradation analysis, and the development of more effective conservation strategies for modern oil paintings.</p>
	]]></content:encoded>

	<dc:title>Electromagnetic Diagnostic Techniques for the Conservation of Modern Oil Paintings: A Review</dc:title>
			<dc:creator>Patrizia Piersigilli</dc:creator>
			<dc:creator>Rocco Citroni</dc:creator>
			<dc:creator>Fabio Mangini</dc:creator>
			<dc:creator>Fabrizio Frezza</dc:creator>
		<dc:identifier>doi: 10.3390/info17060522</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-25</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-25</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>522</prism:startingPage>
		<prism:doi>10.3390/info17060522</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/522</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/521">

	<title>Information, Vol. 17, Pages 521: DGAM: Dual-Guided Anomaly Mining for Semi-Supervised Graph Anomaly Detection</title>
	<link>https://www.mdpi.com/2078-2489/17/6/521</link>
	<description>For the challenging scenario in which only normal node labels are available in semi-supervised graph anomaly detection, existing generative methods usually synthesize abnormal nodes through random perturbation or feature interpolation. However, these methods fail to consider node abnormality comprehensively from both structural and attribute perspectives, resulting in generated pseudo-anomalies of limited quality and insufficient reliability. In order to address this problem, we propose DGAM (dual-guided anomaly mining), a framework for selecting pseudo-anomaly nodes based on the dual-index measurement of topological anomaly and feature consistency. The core of the framework is the joint anomaly evaluation module, which quantifies node anomaly through two computable metrics. The topological boundary score (TBS) measures the boundary of a node&amp;amp;rsquo;s topological position based on the proportion of connections between a node and labeled normal nodes in its K-hop neighborhood. The feature deviation score (FDS) evaluates the consistency of a node&amp;amp;rsquo;s local features by calculating the average cosine similarity between its features and those of its K-hop neighbors. The module selects a fixed set of nodes with higher comprehensive anomaly scores from the labeled normal nodes as pseudo-anomalies, so as to construct a training set containing explicit supervision signals. The model adopts a shared encoder architecture and jointly optimizes the classification loss based on pseudo-labels and the embedding regularization loss of the graph nodes to learn a more discriminative node representation. Experimental results on multiple real-world graph datasets show that DGAM can stably improve anomaly detection performance, effectively verifying the effectiveness of the proposed screening mechanism and joint training strategy.</description>
	<pubDate>2026-05-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 521: DGAM: Dual-Guided Anomaly Mining for Semi-Supervised Graph Anomaly Detection</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/521">doi: 10.3390/info17060521</a></p>
	<p>Authors:
		Xingxuan Li
		Ting Guo
		Zhen Tian
		</p>
	<p>For the challenging scenario in which only normal node labels are available in semi-supervised graph anomaly detection, existing generative methods usually synthesize abnormal nodes through random perturbation or feature interpolation. However, these methods fail to consider node abnormality comprehensively from both structural and attribute perspectives, resulting in generated pseudo-anomalies of limited quality and insufficient reliability. In order to address this problem, we propose DGAM (dual-guided anomaly mining), a framework for selecting pseudo-anomaly nodes based on the dual-index measurement of topological anomaly and feature consistency. The core of the framework is the joint anomaly evaluation module, which quantifies node anomaly through two computable metrics. The topological boundary score (TBS) measures the boundary of a node&amp;amp;rsquo;s topological position based on the proportion of connections between a node and labeled normal nodes in its K-hop neighborhood. The feature deviation score (FDS) evaluates the consistency of a node&amp;amp;rsquo;s local features by calculating the average cosine similarity between its features and those of its K-hop neighbors. The module selects a fixed set of nodes with higher comprehensive anomaly scores from the labeled normal nodes as pseudo-anomalies, so as to construct a training set containing explicit supervision signals. The model adopts a shared encoder architecture and jointly optimizes the classification loss based on pseudo-labels and the embedding regularization loss of the graph nodes to learn a more discriminative node representation. Experimental results on multiple real-world graph datasets show that DGAM can stably improve anomaly detection performance, effectively verifying the effectiveness of the proposed screening mechanism and joint training strategy.</p>
	]]></content:encoded>

	<dc:title>DGAM: Dual-Guided Anomaly Mining for Semi-Supervised Graph Anomaly Detection</dc:title>
			<dc:creator>Xingxuan Li</dc:creator>
			<dc:creator>Ting Guo</dc:creator>
			<dc:creator>Zhen Tian</dc:creator>
		<dc:identifier>doi: 10.3390/info17060521</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>521</prism:startingPage>
		<prism:doi>10.3390/info17060521</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/521</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/519">

	<title>Information, Vol. 17, Pages 519: A Quantitative Explainability Quality Index Framework for Visual XAI in Fuzzy Group Decision-Making for Supply Chain Facility Localization</title>
	<link>https://www.mdpi.com/2078-2489/17/6/519</link>
	<description>Visual explainable artificial intelligence (XAI) is an important mechanism for connecting analytically complex decision models with practitioners who must interpret and act upon their outputs in industrial supply chains. In facility localization problems, wafer foundries and other capital-intensive manufacturers must evaluate geographically dispersed candidate sites against multiple uncertain criteria. The ability to communicate fuzzy group decision-making (FGDM) outcomes in a transparent, interpretable form has direct operational relevance. The literature has introduced hanging gradient bar charts, gradient bidirectional scatterplots, and traceable aggregation charts as visual XAI instruments for semiconductor supply chain localization that show substantial reductions in interpretation error versus conventional plots. However, the quantitative assessment of explanation quality itself remains underdeveloped. To address such a gap, this research proposes a quantitative explainability quality index (XQI) that formalizes visual explanation quality in FGDM as a composite measurable construct. XQI integrates two complementary layers: (1) An objective explainability layer (OEI), consisting of normalized fuzzy interpretation deviation, response time, ranking fidelity, and interpretation accuracy, and (2) a subjective explainability layer (SEI), consisting of perceived understanding, perceived transparency, decision confidence, and cognitive load. Trust, acceptance, and decision quality are downstream outcome constructs rather than components of the index. A weighted linear combination of OEI and SEI produces a single index for systematic, reproducible comparison across competing visualization designs. A structural equation model is specified as a planned validation mechanism for examining how explanation quality may relate to trust, acceptance, and downstream decision quality. The proposed validation framework includes a semiconductor facility localization scenario, three visualization conditions, and a planned participant pool of 150&amp;amp;ndash;240 supply chain managers, engineers, and graduate students. The XQI framework transforms visual XAI from a descriptive communication aid into a testable decision-support construct, thereby addressing a key evaluation gap in the FGDM visualization literature.</description>
	<pubDate>2026-05-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 519: A Quantitative Explainability Quality Index Framework for Visual XAI in Fuzzy Group Decision-Making for Supply Chain Facility Localization</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/519">doi: 10.3390/info17060519</a></p>
	<p>Authors:
		Yu-Cheng Wang
		</p>
	<p>Visual explainable artificial intelligence (XAI) is an important mechanism for connecting analytically complex decision models with practitioners who must interpret and act upon their outputs in industrial supply chains. In facility localization problems, wafer foundries and other capital-intensive manufacturers must evaluate geographically dispersed candidate sites against multiple uncertain criteria. The ability to communicate fuzzy group decision-making (FGDM) outcomes in a transparent, interpretable form has direct operational relevance. The literature has introduced hanging gradient bar charts, gradient bidirectional scatterplots, and traceable aggregation charts as visual XAI instruments for semiconductor supply chain localization that show substantial reductions in interpretation error versus conventional plots. However, the quantitative assessment of explanation quality itself remains underdeveloped. To address such a gap, this research proposes a quantitative explainability quality index (XQI) that formalizes visual explanation quality in FGDM as a composite measurable construct. XQI integrates two complementary layers: (1) An objective explainability layer (OEI), consisting of normalized fuzzy interpretation deviation, response time, ranking fidelity, and interpretation accuracy, and (2) a subjective explainability layer (SEI), consisting of perceived understanding, perceived transparency, decision confidence, and cognitive load. Trust, acceptance, and decision quality are downstream outcome constructs rather than components of the index. A weighted linear combination of OEI and SEI produces a single index for systematic, reproducible comparison across competing visualization designs. A structural equation model is specified as a planned validation mechanism for examining how explanation quality may relate to trust, acceptance, and downstream decision quality. The proposed validation framework includes a semiconductor facility localization scenario, three visualization conditions, and a planned participant pool of 150&amp;amp;ndash;240 supply chain managers, engineers, and graduate students. The XQI framework transforms visual XAI from a descriptive communication aid into a testable decision-support construct, thereby addressing a key evaluation gap in the FGDM visualization literature.</p>
	]]></content:encoded>

	<dc:title>A Quantitative Explainability Quality Index Framework for Visual XAI in Fuzzy Group Decision-Making for Supply Chain Facility Localization</dc:title>
			<dc:creator>Yu-Cheng Wang</dc:creator>
		<dc:identifier>doi: 10.3390/info17060519</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>519</prism:startingPage>
		<prism:doi>10.3390/info17060519</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/519</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/520">

	<title>Information, Vol. 17, Pages 520: Exploring the Application of Information and Communication Technologies in Age-Friendly Healthcare: A Systematic Scoping Review</title>
	<link>https://www.mdpi.com/2078-2489/17/6/520</link>
	<description>The rapidly aging global population is placing immense pressure on healthcare systems, which are struggling to meet the needs of older adults. Information and communication technologies (ICTs) are considered a key driver in supporting the development of age-friendly healthcare models. This scoping review aims to map and structure the multifaceted applications of ICTs in age-friendly healthcare, focusing on their design, benefits, challenges, and implementation in different contexts. We followed the PRISMA-ScR guidelines and conducted a systematic search of five major databases (Web of Science, Scopus, PubMed, ScienceDirect, and IEEE Xplore), supplemented with backward citation chaining to improve the robustness of literature identification. The results show that ICTs can help older adults by improving their access to healthcare information, enhancing their care coordination, supporting their independent living, and personalizing their health management. Key challenges include user experience issues for older adults, data privacy and security concerns, and implementation barriers related to resources and professional support. Effective implementation of ICTs requires greater emphasis on age-centered design, robust data governance, and scalable integration with existing healthcare systems. We further propose a Technology Design&amp;amp;ndash;Scenario Application&amp;amp;ndash;Effect Evaluation (TD-SA-EE) analytical framework for ICT application in age-friendly healthcare; the framework is grounded in sociotechnical systems theory to provide explanatory insights beyond descriptive classification. This research provides insights into optimizing age-friendly healthcare through ICTs and contributes to fully leveraging ICTs in building sustainable and equitable age-friendly healthcare systems.</description>
	<pubDate>2026-05-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 520: Exploring the Application of Information and Communication Technologies in Age-Friendly Healthcare: A Systematic Scoping Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/520">doi: 10.3390/info17060520</a></p>
	<p>Authors:
		Jiahao Li
		Yilin Zhai
		Jun Ma
		</p>
	<p>The rapidly aging global population is placing immense pressure on healthcare systems, which are struggling to meet the needs of older adults. Information and communication technologies (ICTs) are considered a key driver in supporting the development of age-friendly healthcare models. This scoping review aims to map and structure the multifaceted applications of ICTs in age-friendly healthcare, focusing on their design, benefits, challenges, and implementation in different contexts. We followed the PRISMA-ScR guidelines and conducted a systematic search of five major databases (Web of Science, Scopus, PubMed, ScienceDirect, and IEEE Xplore), supplemented with backward citation chaining to improve the robustness of literature identification. The results show that ICTs can help older adults by improving their access to healthcare information, enhancing their care coordination, supporting their independent living, and personalizing their health management. Key challenges include user experience issues for older adults, data privacy and security concerns, and implementation barriers related to resources and professional support. Effective implementation of ICTs requires greater emphasis on age-centered design, robust data governance, and scalable integration with existing healthcare systems. We further propose a Technology Design&amp;amp;ndash;Scenario Application&amp;amp;ndash;Effect Evaluation (TD-SA-EE) analytical framework for ICT application in age-friendly healthcare; the framework is grounded in sociotechnical systems theory to provide explanatory insights beyond descriptive classification. This research provides insights into optimizing age-friendly healthcare through ICTs and contributes to fully leveraging ICTs in building sustainable and equitable age-friendly healthcare systems.</p>
	]]></content:encoded>

	<dc:title>Exploring the Application of Information and Communication Technologies in Age-Friendly Healthcare: A Systematic Scoping Review</dc:title>
			<dc:creator>Jiahao Li</dc:creator>
			<dc:creator>Yilin Zhai</dc:creator>
			<dc:creator>Jun Ma</dc:creator>
		<dc:identifier>doi: 10.3390/info17060520</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>520</prism:startingPage>
		<prism:doi>10.3390/info17060520</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/520</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/518">

	<title>Information, Vol. 17, Pages 518: IWOA-LightGBM: Hyperparameter Optimization for Sensor Data Anomaly Detection</title>
	<link>https://www.mdpi.com/2078-2489/17/6/518</link>
	<description>Anomaly detection performance in sensor data is highly sensitive to model hyperparameters, which is central to reliable monitoring in mobile Internet security and industrial IoT (IIoT) scenarios. We propose an IWOA-LightGBM-based anomaly detection method for sensor data. For machine learning-based anomaly detection methods, hyperparameter selection often determines model performance, so we propose an Improved Whale Optimization Algorithm (IWOA) and further use it to optimize the hyperparameters of the LightGBM algorithm. To avoid falling into local optima and accelerate algorithm convergence, the WOA is improved by integrating nonlinear convergence factor, adaptive inertia weight factor and stochastic differential mutation strategy. Experimental results show that during hyperparameter optimization for LightGBM model training, the IWOA achieves faster convergence and higher computational efficiency compared to the Whale Optimization Algorithm (WOA), with anomaly detection accuracy exceeding 90%.</description>
	<pubDate>2026-05-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 518: IWOA-LightGBM: Hyperparameter Optimization for Sensor Data Anomaly Detection</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/518">doi: 10.3390/info17060518</a></p>
	<p>Authors:
		Rong Huang
		Qiqiang Wu
		Mingwei Yang
		Yanhua Liu
		Baokang Zhao
		</p>
	<p>Anomaly detection performance in sensor data is highly sensitive to model hyperparameters, which is central to reliable monitoring in mobile Internet security and industrial IoT (IIoT) scenarios. We propose an IWOA-LightGBM-based anomaly detection method for sensor data. For machine learning-based anomaly detection methods, hyperparameter selection often determines model performance, so we propose an Improved Whale Optimization Algorithm (IWOA) and further use it to optimize the hyperparameters of the LightGBM algorithm. To avoid falling into local optima and accelerate algorithm convergence, the WOA is improved by integrating nonlinear convergence factor, adaptive inertia weight factor and stochastic differential mutation strategy. Experimental results show that during hyperparameter optimization for LightGBM model training, the IWOA achieves faster convergence and higher computational efficiency compared to the Whale Optimization Algorithm (WOA), with anomaly detection accuracy exceeding 90%.</p>
	]]></content:encoded>

	<dc:title>IWOA-LightGBM: Hyperparameter Optimization for Sensor Data Anomaly Detection</dc:title>
			<dc:creator>Rong Huang</dc:creator>
			<dc:creator>Qiqiang Wu</dc:creator>
			<dc:creator>Mingwei Yang</dc:creator>
			<dc:creator>Yanhua Liu</dc:creator>
			<dc:creator>Baokang Zhao</dc:creator>
		<dc:identifier>doi: 10.3390/info17060518</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>518</prism:startingPage>
		<prism:doi>10.3390/info17060518</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/518</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/517">

	<title>Information, Vol. 17, Pages 517: Leveraging Feature Selection and Ensemble Learning to Predict Secondary School Achievement: A Comparative Study of Three Grade Granularities</title>
	<link>https://www.mdpi.com/2078-2489/17/6/517</link>
	<description>Predictive analytics has become increasingly important in educational decision-making, supporting at-risk identification and adaptive tutoring. The accurate early prediction of school achievement can enable timely intervention. Using the Math Students dataset, which contains data on students from two Portuguese secondary schools, we model three categorical outcomes derived from the students&amp;amp;rsquo; final grade, namely the final grade level (low, medium, high), its qualitative evaluation (fail, satisfactory, good, excellent), and the final pass/fail outcome. After preprocessing, three filter methods&amp;amp;mdash;Correlation-Based Feature Subset Selection (CFS), Correlation Attribute Evaluation (CorrEval), and Information Gain (InfoGain)&amp;amp;mdash;are applied to reduce the dimensionality of the datasets. Nine classifiers (Naive Bayes, Logistic, MLP, SMO, IBk, Bagging, J48, Random Forest, Random Tree) are evaluated using ten-fold cross-validation in the Waikato Environment for Knowledge Analysis (Weka) platform. Random Forest with InfoGain achieves 90.7% accuracy on the three-band task, while Bagging with InfoGain achieves 92.5% on the binary pass/fail outcome, outperforming benchmarks in prior Educational Data Mining (EDM) studies. Results confirm that prior academic performance indicators (first- and second-period grades) and failure history dominate predictive power and contribute substantially to the success of ensemble models, particularly when paired with feature selection methods that reduce noise and highlight relevant attributes.</description>
	<pubDate>2026-05-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 517: Leveraging Feature Selection and Ensemble Learning to Predict Secondary School Achievement: A Comparative Study of Three Grade Granularities</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/517">doi: 10.3390/info17060517</a></p>
	<p>Authors:
		Dimitrios Galiatsatos
		Panagiota Galiatsatou
		</p>
	<p>Predictive analytics has become increasingly important in educational decision-making, supporting at-risk identification and adaptive tutoring. The accurate early prediction of school achievement can enable timely intervention. Using the Math Students dataset, which contains data on students from two Portuguese secondary schools, we model three categorical outcomes derived from the students&amp;amp;rsquo; final grade, namely the final grade level (low, medium, high), its qualitative evaluation (fail, satisfactory, good, excellent), and the final pass/fail outcome. After preprocessing, three filter methods&amp;amp;mdash;Correlation-Based Feature Subset Selection (CFS), Correlation Attribute Evaluation (CorrEval), and Information Gain (InfoGain)&amp;amp;mdash;are applied to reduce the dimensionality of the datasets. Nine classifiers (Naive Bayes, Logistic, MLP, SMO, IBk, Bagging, J48, Random Forest, Random Tree) are evaluated using ten-fold cross-validation in the Waikato Environment for Knowledge Analysis (Weka) platform. Random Forest with InfoGain achieves 90.7% accuracy on the three-band task, while Bagging with InfoGain achieves 92.5% on the binary pass/fail outcome, outperforming benchmarks in prior Educational Data Mining (EDM) studies. Results confirm that prior academic performance indicators (first- and second-period grades) and failure history dominate predictive power and contribute substantially to the success of ensemble models, particularly when paired with feature selection methods that reduce noise and highlight relevant attributes.</p>
	]]></content:encoded>

	<dc:title>Leveraging Feature Selection and Ensemble Learning to Predict Secondary School Achievement: A Comparative Study of Three Grade Granularities</dc:title>
			<dc:creator>Dimitrios Galiatsatos</dc:creator>
			<dc:creator>Panagiota Galiatsatou</dc:creator>
		<dc:identifier>doi: 10.3390/info17060517</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>517</prism:startingPage>
		<prism:doi>10.3390/info17060517</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/517</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/516">

	<title>Information, Vol. 17, Pages 516: NS-Dep-KAN: An Explainable Neuro-Symbolic Framework with Kolmogorov&amp;ndash;Arnold Networks for DSM-Guided Depression Assessment</title>
	<link>https://www.mdpi.com/2078-2489/17/6/516</link>
	<description>Automated depression assessment is critical for scalable mental healthcare but faces dual challenges: the lack of clinical interpretability in &amp;amp;ldquo;black-box&amp;amp;rdquo; deep learning models and the excessive computational cost of large-scale fusion architectures. To bridge this gap, we propose NS-Dep-KAN, a novel neuro-symbolic framework that harmonizes DSM-5-guided reasoning with Kolmogorov&amp;amp;ndash;Arnold Networks (KANs). Our approach leverages a Large Language Model (LLM) to extract symbolic symptom evidence aligned with diagnostic criteria, which then guides the aggregation of multimodal features from frozen pretrained encoders (WavLM and Qwen). Unlike traditional Multi-Layer Perceptrons, the proposed KAN prediction head employs learnable B-spline activation functions to capture complex nonlinear symptom&amp;amp;ndash;severity mappings with extreme parameter efficiency. Evaluations on the DAIC-WOZ benchmark demonstrate that NS-Dep-KAN achieves state-of-the-art performance among audio-text models (MAE 2.69, 13.5% improvement over the three-modality baseline MSGAF at MAE 3.11), with only &amp;amp;sim;4.9 K trainable parameters. Moreover, the framework offers inherent interpretability, revealing granular symptom contribution profiles that align with clinical intuition. This work establishes a path toward explainable trustworthy AI for mental health screening.</description>
	<pubDate>2026-05-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 516: NS-Dep-KAN: An Explainable Neuro-Symbolic Framework with Kolmogorov&amp;ndash;Arnold Networks for DSM-Guided Depression Assessment</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/516">doi: 10.3390/info17060516</a></p>
	<p>Authors:
		Qiong Hong
		Lailatul Qadri Zakaria
		Sabrina Tiun
		</p>
	<p>Automated depression assessment is critical for scalable mental healthcare but faces dual challenges: the lack of clinical interpretability in &amp;amp;ldquo;black-box&amp;amp;rdquo; deep learning models and the excessive computational cost of large-scale fusion architectures. To bridge this gap, we propose NS-Dep-KAN, a novel neuro-symbolic framework that harmonizes DSM-5-guided reasoning with Kolmogorov&amp;amp;ndash;Arnold Networks (KANs). Our approach leverages a Large Language Model (LLM) to extract symbolic symptom evidence aligned with diagnostic criteria, which then guides the aggregation of multimodal features from frozen pretrained encoders (WavLM and Qwen). Unlike traditional Multi-Layer Perceptrons, the proposed KAN prediction head employs learnable B-spline activation functions to capture complex nonlinear symptom&amp;amp;ndash;severity mappings with extreme parameter efficiency. Evaluations on the DAIC-WOZ benchmark demonstrate that NS-Dep-KAN achieves state-of-the-art performance among audio-text models (MAE 2.69, 13.5% improvement over the three-modality baseline MSGAF at MAE 3.11), with only &amp;amp;sim;4.9 K trainable parameters. Moreover, the framework offers inherent interpretability, revealing granular symptom contribution profiles that align with clinical intuition. This work establishes a path toward explainable trustworthy AI for mental health screening.</p>
	]]></content:encoded>

	<dc:title>NS-Dep-KAN: An Explainable Neuro-Symbolic Framework with Kolmogorov&amp;amp;ndash;Arnold Networks for DSM-Guided Depression Assessment</dc:title>
			<dc:creator>Qiong Hong</dc:creator>
			<dc:creator>Lailatul Qadri Zakaria</dc:creator>
			<dc:creator>Sabrina Tiun</dc:creator>
		<dc:identifier>doi: 10.3390/info17060516</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>516</prism:startingPage>
		<prism:doi>10.3390/info17060516</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/516</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/515">

	<title>Information, Vol. 17, Pages 515: Predicting Academic Award Recognition Across Disciplines Using Publication-Based Bibliometric Indices and SHAP-Driven Explainability</title>
	<link>https://www.mdpi.com/2078-2489/17/6/515</link>
	<description>Researcher evaluation underpins critical academic decisions, yet traditional bibliometric indicators lack predictive capability and cross-domain generalizability, while most predictive approaches offer limited interpretability and narrow domain validation. This study proposes a SHAP interpretable, multi-domain supervised learning framework for predicting academic award recognition using thirty two publication count-based bibliometric indices. A balanced dataset was constructed across four disciplines, namely Computer Science, Neuroscience, Mathematics, and Civil Engineering, comprising verified awardees from recognized professional societies and matched non-awardee researchers. Eight classifiers were evaluated under stratified five fold cross validation, assessed via accuracy, precision, recall, F1-score, and ROC AUC. The framework achieved domain-specific F1-scores of 0.70 in Computer Science, 0.73 in Neuroscience, 0.72 in Civil Engineering, and 0.78 in Mathematics, with SVM and XGBoost demonstrating the strongest cross-domain robustness across disciplines. SHAP analysis consistently identified normalized h index, h2 family, q2 index, and g index as dominant cross-domain predictors, while domain-specific indicators, including Rm and w indices in Neuroscience and P index in Civil Engineering, reflected disciplinary recognition patterns. By unifying publication-based feature engineering, multi-domain classification, and SHAP explainability within a single reproducible pipeline, this framework offers a scalable, transparent, and evidence-based tool for institutional researcher evaluation.</description>
	<pubDate>2026-05-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 515: Predicting Academic Award Recognition Across Disciplines Using Publication-Based Bibliometric Indices and SHAP-Driven Explainability</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/515">doi: 10.3390/info17060515</a></p>
	<p>Authors:
		Muhammad Shaban Qabil
		Hafiza Zarafshan Mukhtiar
		Ghulam Mustafa
		Muhammad Tanvir Afzal
		Isabel De la Torre Díez
		Elizabeth Caro Montero
		Mirtha Silvana Garat de Marin
		</p>
	<p>Researcher evaluation underpins critical academic decisions, yet traditional bibliometric indicators lack predictive capability and cross-domain generalizability, while most predictive approaches offer limited interpretability and narrow domain validation. This study proposes a SHAP interpretable, multi-domain supervised learning framework for predicting academic award recognition using thirty two publication count-based bibliometric indices. A balanced dataset was constructed across four disciplines, namely Computer Science, Neuroscience, Mathematics, and Civil Engineering, comprising verified awardees from recognized professional societies and matched non-awardee researchers. Eight classifiers were evaluated under stratified five fold cross validation, assessed via accuracy, precision, recall, F1-score, and ROC AUC. The framework achieved domain-specific F1-scores of 0.70 in Computer Science, 0.73 in Neuroscience, 0.72 in Civil Engineering, and 0.78 in Mathematics, with SVM and XGBoost demonstrating the strongest cross-domain robustness across disciplines. SHAP analysis consistently identified normalized h index, h2 family, q2 index, and g index as dominant cross-domain predictors, while domain-specific indicators, including Rm and w indices in Neuroscience and P index in Civil Engineering, reflected disciplinary recognition patterns. By unifying publication-based feature engineering, multi-domain classification, and SHAP explainability within a single reproducible pipeline, this framework offers a scalable, transparent, and evidence-based tool for institutional researcher evaluation.</p>
	]]></content:encoded>

	<dc:title>Predicting Academic Award Recognition Across Disciplines Using Publication-Based Bibliometric Indices and SHAP-Driven Explainability</dc:title>
			<dc:creator>Muhammad Shaban Qabil</dc:creator>
			<dc:creator>Hafiza Zarafshan Mukhtiar</dc:creator>
			<dc:creator>Ghulam Mustafa</dc:creator>
			<dc:creator>Muhammad Tanvir Afzal</dc:creator>
			<dc:creator>Isabel De la Torre Díez</dc:creator>
			<dc:creator>Elizabeth Caro Montero</dc:creator>
			<dc:creator>Mirtha Silvana Garat de Marin</dc:creator>
		<dc:identifier>doi: 10.3390/info17060515</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>515</prism:startingPage>
		<prism:doi>10.3390/info17060515</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/515</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/6/513">

	<title>Information, Vol. 17, Pages 513: V2W-LLM: Automated Vulnerability to Weakness Mapping Based on Large Language Model</title>
	<link>https://www.mdpi.com/2078-2489/17/6/513</link>
	<description>To address the rapid growth of software vulnerabilities, the latency of manual expert classification, and the limitations of existing methods restricted to fixed categories, this paper proposes V2W-LLM, an automated vulnerability-to-weakness mapping model based on Large Language Models (LLMs). First, a dataset of CVE-CWE description pairs is constructed based on established expert correlations from MITRE. Subsequently, the LLM is instruction-tuned on this dataset to leverage its reasoning capabilities in generating CWE-style descriptive text for newly disclosed, unmapped vulnerabilities. Finally, using a BAAI-based embedding model, the semantic representations of the generated text and official CWE descriptions are computed to identify the optimal mapping via cosine similarity (Top-1). Experimental results indicate that V2W-LLM achieves an accuracy of 90.18% and a Macro-F1 of 87.64% in common categories. Furthermore, on the public ChatGPT-VDMEval and the latest 2024 NVD datasets, the model attains F1 scores of 86.02% and 94.02% respectively, validating its effectiveness in automating the vulnerability-to-weakness mapping process.</description>
	<pubDate>2026-05-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 513: V2W-LLM: Automated Vulnerability to Weakness Mapping Based on Large Language Model</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/6/513">doi: 10.3390/info17060513</a></p>
	<p>Authors:
		Ziguo Wang
		Mei Nian
		Yaling Jing
		Jun Zhang
		</p>
	<p>To address the rapid growth of software vulnerabilities, the latency of manual expert classification, and the limitations of existing methods restricted to fixed categories, this paper proposes V2W-LLM, an automated vulnerability-to-weakness mapping model based on Large Language Models (LLMs). First, a dataset of CVE-CWE description pairs is constructed based on established expert correlations from MITRE. Subsequently, the LLM is instruction-tuned on this dataset to leverage its reasoning capabilities in generating CWE-style descriptive text for newly disclosed, unmapped vulnerabilities. Finally, using a BAAI-based embedding model, the semantic representations of the generated text and official CWE descriptions are computed to identify the optimal mapping via cosine similarity (Top-1). Experimental results indicate that V2W-LLM achieves an accuracy of 90.18% and a Macro-F1 of 87.64% in common categories. Furthermore, on the public ChatGPT-VDMEval and the latest 2024 NVD datasets, the model attains F1 scores of 86.02% and 94.02% respectively, validating its effectiveness in automating the vulnerability-to-weakness mapping process.</p>
	]]></content:encoded>

	<dc:title>V2W-LLM: Automated Vulnerability to Weakness Mapping Based on Large Language Model</dc:title>
			<dc:creator>Ziguo Wang</dc:creator>
			<dc:creator>Mei Nian</dc:creator>
			<dc:creator>Yaling Jing</dc:creator>
			<dc:creator>Jun Zhang</dc:creator>
		<dc:identifier>doi: 10.3390/info17060513</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>6</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>513</prism:startingPage>
		<prism:doi>10.3390/info17060513</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/6/513</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/514">

	<title>Information, Vol. 17, Pages 514: Training-Free Binary Projection Filtering for Dense Retrieval: An Empirical Study of Candidate Reduction, Ranking Stability, and Failure Risk</title>
	<link>https://www.mdpi.com/2078-2489/17/5/514</link>
	<description>Dense retrieval pipelines often rely on large candidate pools before reranking, making candidate generation and downstream scoring a practical bottleneck. This paper studies training-free binary projection filtering as a lightweight pre-filter for reducing the candidate set before dense reranking. Rather than presenting it as a universally superior retrieval method or a validated speedup technique, we ask a narrower practical question: how far can the candidate pool be reduced before average top-rank quality, retained relevance, and query-level reliability begin to break down? We evaluate the approach on five BEIR datasets: SciFact, NFCorpus, FiQA, ArguAna, and TREC-COVID. The revised evaluation compares exhaustive Dense retrieval, FAISS-HNSW, FAISS-IVF-Flat, and Binary+Dense retrieval, and includes projection-dimension ablations over Db&amp;amp;isin;{128,256,512,1000}, candidate-budget ablations over K&amp;amp;isin;{50,100,200,500}, five-seed robustness analysis, and typo-perturbed queries. In addition to MRR@10, nDCG@10, and Recall@100, we report filter-stage metrics including Retained@K, catastrophic failure rate, and Best Relevant Survival. Across datasets, Binary+Dense often remains close to exhaustive Dense retrieval in average top-rank metrics at representative operating points, but the filter-stage behavior is strongly collection-dependent. Larger Db and K generally improve retained relevance and reduce catastrophic failures, but they also increase filtering cost or reduce the degree of pruning. The latency results show that structural candidate reduction does not translate into consistent end-to-end wall-clock speedup in the current Python 3.16/NumPy implementation. Taken together, the results suggest that training-free binary projection filtering is best understood as a calibration-sensitive pre-filter and failure risk analysis mechanism rather than as a replacement for Dense or ANN retrieval.</description>
	<pubDate>2026-05-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 514: Training-Free Binary Projection Filtering for Dense Retrieval: An Empirical Study of Candidate Reduction, Ranking Stability, and Failure Risk</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/514">doi: 10.3390/info17050514</a></p>
	<p>Authors:
		Tip-aroon Kiawkaew
		Thanaruk Theeramunkong
		</p>
	<p>Dense retrieval pipelines often rely on large candidate pools before reranking, making candidate generation and downstream scoring a practical bottleneck. This paper studies training-free binary projection filtering as a lightweight pre-filter for reducing the candidate set before dense reranking. Rather than presenting it as a universally superior retrieval method or a validated speedup technique, we ask a narrower practical question: how far can the candidate pool be reduced before average top-rank quality, retained relevance, and query-level reliability begin to break down? We evaluate the approach on five BEIR datasets: SciFact, NFCorpus, FiQA, ArguAna, and TREC-COVID. The revised evaluation compares exhaustive Dense retrieval, FAISS-HNSW, FAISS-IVF-Flat, and Binary+Dense retrieval, and includes projection-dimension ablations over Db&amp;amp;isin;{128,256,512,1000}, candidate-budget ablations over K&amp;amp;isin;{50,100,200,500}, five-seed robustness analysis, and typo-perturbed queries. In addition to MRR@10, nDCG@10, and Recall@100, we report filter-stage metrics including Retained@K, catastrophic failure rate, and Best Relevant Survival. Across datasets, Binary+Dense often remains close to exhaustive Dense retrieval in average top-rank metrics at representative operating points, but the filter-stage behavior is strongly collection-dependent. Larger Db and K generally improve retained relevance and reduce catastrophic failures, but they also increase filtering cost or reduce the degree of pruning. The latency results show that structural candidate reduction does not translate into consistent end-to-end wall-clock speedup in the current Python 3.16/NumPy implementation. Taken together, the results suggest that training-free binary projection filtering is best understood as a calibration-sensitive pre-filter and failure risk analysis mechanism rather than as a replacement for Dense or ANN retrieval.</p>
	]]></content:encoded>

	<dc:title>Training-Free Binary Projection Filtering for Dense Retrieval: An Empirical Study of Candidate Reduction, Ranking Stability, and Failure Risk</dc:title>
			<dc:creator>Tip-aroon Kiawkaew</dc:creator>
			<dc:creator>Thanaruk Theeramunkong</dc:creator>
		<dc:identifier>doi: 10.3390/info17050514</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>514</prism:startingPage>
		<prism:doi>10.3390/info17050514</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/514</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/512">

	<title>Information, Vol. 17, Pages 512: CMA-YOLO: A Network for Wind Turbine Blade Surface Defect Detection with Multi-Scale Features and Dual Attention</title>
	<link>https://www.mdpi.com/2078-2489/17/5/512</link>
	<description>This paper introduces CMA-YOLO, a network that integrates multi-scale features with dual attention mechanisms to address weak feature representation, low detection accuracy, and loss of fine-grained details in deep networks for wind turbine blade surface defect detection. First, we construct the C2MSA module by designing a Multi-scale Feature-enhanced Attention Convolution Mix (MS-ACmix) based on ACmix and embedding it into the C2PSA block. This lets the network capture local and global contextual features, strengthening multi-scale target recognition and lowering missed detections. Second, we devise a Monte Carlo Dual Attention (MCDA) mechanism combining random sampling with dual attention. This approach retains the regularization benefits of the Monte Carlo method while leveraging dual attention selection, enabling improved detection accuracy with low computational cost. Finally, we substitute the original downsampling layers in the backbone and neck with the ADown module. This lightweight design, together with efficient feature extraction and fusion, reduces fine-grained detail loss and improves defect detection capability. Quantitative results reveal that, compared to YOLO11n, CMA-YOLO yields improvements of 3.4% in mAP@0.5, 6.1% in mAP@0.5:0.95, and 8.8% in recall, with a 0.7 GFLOPs reduction in computational cost, thus validating the proposed algorithm. Overall, CMA-YOLO provides a lightweight and effective approach for inspecting blade surface defects on wind turbines operating in resource-limited settings.</description>
	<pubDate>2026-05-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 512: CMA-YOLO: A Network for Wind Turbine Blade Surface Defect Detection with Multi-Scale Features and Dual Attention</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/512">doi: 10.3390/info17050512</a></p>
	<p>Authors:
		Weining Li
		Songsong Li
		Xingshuo Yue
		Xu Wang
		Yuhang Zhu
		Xiaoming Chen
		</p>
	<p>This paper introduces CMA-YOLO, a network that integrates multi-scale features with dual attention mechanisms to address weak feature representation, low detection accuracy, and loss of fine-grained details in deep networks for wind turbine blade surface defect detection. First, we construct the C2MSA module by designing a Multi-scale Feature-enhanced Attention Convolution Mix (MS-ACmix) based on ACmix and embedding it into the C2PSA block. This lets the network capture local and global contextual features, strengthening multi-scale target recognition and lowering missed detections. Second, we devise a Monte Carlo Dual Attention (MCDA) mechanism combining random sampling with dual attention. This approach retains the regularization benefits of the Monte Carlo method while leveraging dual attention selection, enabling improved detection accuracy with low computational cost. Finally, we substitute the original downsampling layers in the backbone and neck with the ADown module. This lightweight design, together with efficient feature extraction and fusion, reduces fine-grained detail loss and improves defect detection capability. Quantitative results reveal that, compared to YOLO11n, CMA-YOLO yields improvements of 3.4% in mAP@0.5, 6.1% in mAP@0.5:0.95, and 8.8% in recall, with a 0.7 GFLOPs reduction in computational cost, thus validating the proposed algorithm. Overall, CMA-YOLO provides a lightweight and effective approach for inspecting blade surface defects on wind turbines operating in resource-limited settings.</p>
	]]></content:encoded>

	<dc:title>CMA-YOLO: A Network for Wind Turbine Blade Surface Defect Detection with Multi-Scale Features and Dual Attention</dc:title>
			<dc:creator>Weining Li</dc:creator>
			<dc:creator>Songsong Li</dc:creator>
			<dc:creator>Xingshuo Yue</dc:creator>
			<dc:creator>Xu Wang</dc:creator>
			<dc:creator>Yuhang Zhu</dc:creator>
			<dc:creator>Xiaoming Chen</dc:creator>
		<dc:identifier>doi: 10.3390/info17050512</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>512</prism:startingPage>
		<prism:doi>10.3390/info17050512</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/512</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/511">

	<title>Information, Vol. 17, Pages 511: A Modular Approach to Automated Archery Coaching for Action Quality Assessment and Feedback Generation Using Large Language Models</title>
	<link>https://www.mdpi.com/2078-2489/17/5/511</link>
	<description>Archery is a fine-grained skill sport in which small posture deviations can markedly affect performance, motivating the need for reliable automated technique assessment. However, most existing methods still focus on large-amplitude sports and cannot match coach-level nuance. To overcome these limitations, we introduce SEMA (Semantic Evidence-Driven Multimodal Assessment), a large language model (LLM)-based end-to-end system for fine-grained archery action quality assessment. Beyond score prediction and evaluation-text generation, SEMA further supports knowledge-grounded question answering and feedback generation through a hierarchical multi-source knowledge framework that integrates assessment outputs, structured coaching guidance, and general archery knowledge. Experimental results show that SEMA achieves strong performance on the novel AAV dataset, outperforming general-purpose VLMs and adapted prior AQA methods. In addition, we introduce the AAV (Archery Action Video) dataset, the first multimodal, fine-grained action quality assessment (AQA) dataset dedicated to archery, and release it publicly to the community. This dataset addresses a critical gap in current benchmarks for assessing archery action quality and intelligent archery training.</description>
	<pubDate>2026-05-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 511: A Modular Approach to Automated Archery Coaching for Action Quality Assessment and Feedback Generation Using Large Language Models</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/511">doi: 10.3390/info17050511</a></p>
	<p>Authors:
		Yunyixuan Zhang
		Haoran Wang
		Binrong Zhu
		Xiaozhi Li
		Siyu Xia
		</p>
	<p>Archery is a fine-grained skill sport in which small posture deviations can markedly affect performance, motivating the need for reliable automated technique assessment. However, most existing methods still focus on large-amplitude sports and cannot match coach-level nuance. To overcome these limitations, we introduce SEMA (Semantic Evidence-Driven Multimodal Assessment), a large language model (LLM)-based end-to-end system for fine-grained archery action quality assessment. Beyond score prediction and evaluation-text generation, SEMA further supports knowledge-grounded question answering and feedback generation through a hierarchical multi-source knowledge framework that integrates assessment outputs, structured coaching guidance, and general archery knowledge. Experimental results show that SEMA achieves strong performance on the novel AAV dataset, outperforming general-purpose VLMs and adapted prior AQA methods. In addition, we introduce the AAV (Archery Action Video) dataset, the first multimodal, fine-grained action quality assessment (AQA) dataset dedicated to archery, and release it publicly to the community. This dataset addresses a critical gap in current benchmarks for assessing archery action quality and intelligent archery training.</p>
	]]></content:encoded>

	<dc:title>A Modular Approach to Automated Archery Coaching for Action Quality Assessment and Feedback Generation Using Large Language Models</dc:title>
			<dc:creator>Yunyixuan Zhang</dc:creator>
			<dc:creator>Haoran Wang</dc:creator>
			<dc:creator>Binrong Zhu</dc:creator>
			<dc:creator>Xiaozhi Li</dc:creator>
			<dc:creator>Siyu Xia</dc:creator>
		<dc:identifier>doi: 10.3390/info17050511</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>511</prism:startingPage>
		<prism:doi>10.3390/info17050511</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/511</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/509">

	<title>Information, Vol. 17, Pages 509: A Novice-Friendly Answer Interface with Code Behavior Visualization and AI Assistant for a Python Programming Learning Assistant System</title>
	<link>https://www.mdpi.com/2078-2489/17/5/509</link>
	<description>Nowadays, Python is very popular as the first programming language for novices, including high school students, to learn due to its short code features with rich libraries. Thus, it is important to provide a learning environment supporting studies starting from the fundamentals, since students have no knowledge on how a program runs on a computer. Previously, we have developed a web-based programming learning assistant system (PLAS) to allow the self-study of major programming languages, including Python, by university students. It offers several types of exercise problems that have different learning goals and levels for step-by-step study. Any student answer is automatically marked at the answer interface for quick feedback. However, PLAS has not implemented functions to assist the learning needs of high school-level students. In this paper, we propose a novice-friendly answer interface for a Python programming learning assistant system (PyPLAS) that introduces a code behavior visualization and an AI assistant with learning logs. The visualization allows learners to observe the changes in variable states and the control flow. The assistant provides multi-level hints during learning and reflective feedback after it by analyzing the logs based on engagement, reasoning strategies, learning pace, and tool usage. For evaluation, we implemented the proposed interface using Python Flask for the web platform and Ollama as a locally deployed AI model. A pilot application was conducted with high school students solving introductory Python exercises in PyPLAS. The results showed high task completion, positive questionnaire responses toward embedded visualization and interface usability, and teacher-observed usefulness of the four-dimensional learning analytics for interpreting learner behaviors. These findings provide preliminary evidence for the feasibility and practical value of the proposed interface, while larger controlled studies are required to validate its instructional effectiveness.</description>
	<pubDate>2026-05-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 509: A Novice-Friendly Answer Interface with Code Behavior Visualization and AI Assistant for a Python Programming Learning Assistant System</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/509">doi: 10.3390/info17050509</a></p>
	<p>Authors:
		Zhida Fu
		Nobuo Funabiki
		Zihao Zhu
		Yue Zhang
		Wen-Chung Kao
		Yi-Fang Lee
		Pi-Kuang Tseng
		</p>
	<p>Nowadays, Python is very popular as the first programming language for novices, including high school students, to learn due to its short code features with rich libraries. Thus, it is important to provide a learning environment supporting studies starting from the fundamentals, since students have no knowledge on how a program runs on a computer. Previously, we have developed a web-based programming learning assistant system (PLAS) to allow the self-study of major programming languages, including Python, by university students. It offers several types of exercise problems that have different learning goals and levels for step-by-step study. Any student answer is automatically marked at the answer interface for quick feedback. However, PLAS has not implemented functions to assist the learning needs of high school-level students. In this paper, we propose a novice-friendly answer interface for a Python programming learning assistant system (PyPLAS) that introduces a code behavior visualization and an AI assistant with learning logs. The visualization allows learners to observe the changes in variable states and the control flow. The assistant provides multi-level hints during learning and reflective feedback after it by analyzing the logs based on engagement, reasoning strategies, learning pace, and tool usage. For evaluation, we implemented the proposed interface using Python Flask for the web platform and Ollama as a locally deployed AI model. A pilot application was conducted with high school students solving introductory Python exercises in PyPLAS. The results showed high task completion, positive questionnaire responses toward embedded visualization and interface usability, and teacher-observed usefulness of the four-dimensional learning analytics for interpreting learner behaviors. These findings provide preliminary evidence for the feasibility and practical value of the proposed interface, while larger controlled studies are required to validate its instructional effectiveness.</p>
	]]></content:encoded>

	<dc:title>A Novice-Friendly Answer Interface with Code Behavior Visualization and AI Assistant for a Python Programming Learning Assistant System</dc:title>
			<dc:creator>Zhida Fu</dc:creator>
			<dc:creator>Nobuo Funabiki</dc:creator>
			<dc:creator>Zihao Zhu</dc:creator>
			<dc:creator>Yue Zhang</dc:creator>
			<dc:creator>Wen-Chung Kao</dc:creator>
			<dc:creator>Yi-Fang Lee</dc:creator>
			<dc:creator>Pi-Kuang Tseng</dc:creator>
		<dc:identifier>doi: 10.3390/info17050509</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>509</prism:startingPage>
		<prism:doi>10.3390/info17050509</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/509</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/510">

	<title>Information, Vol. 17, Pages 510: Research on the Nonlinear and Spatial Effects of Digital Financial Information Flow on Industrial Structure Upgrading</title>
	<link>https://www.mdpi.com/2078-2489/17/5/510</link>
	<description>In the digital economy era, digital inclusive finance represents a paradigmatic reconstruction of key economic information flows. This study integrates multi-source panel data of 27 cities in the Yangtze River Delta from 2011 to 2023. By constructing an economic geography composite spatial weight matrix and a nonlinear spatial panel model, this study analyzes the impact of the diffusion of digital inclusive financial information on industrial structure upgrading. The results show that: (1) digital financial inclusion exerts a significant direct effect and spatial spillover effect on industrial structure; (2) the local effect exhibits a &amp;amp;ldquo;U-shaped&amp;amp;rdquo; curve with an accelerating characteristic on the right side; the spatial spillover effect demonstrates an &amp;amp;ldquo;inverted U-shaped&amp;amp;rdquo; curve, revealing the transformation law and threshold effect of the diffusion and aggregation of digital financial information benefits; (3) digital payment and digital credit constitute the core information flows driving the coordinated upgrading of industries; and (4) entrepreneurial activity exerts a partial mediating effects, and exhibits a spatial mediating effect, while the technological innovation only demonstrates a significant local mediating effect. The findings provide quantitative evidence to support the optimization of the digital financial information ecosystem and the realization of coordinated industrial upgrading in the Yangtze River Delta.</description>
	<pubDate>2026-05-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 510: Research on the Nonlinear and Spatial Effects of Digital Financial Information Flow on Industrial Structure Upgrading</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/510">doi: 10.3390/info17050510</a></p>
	<p>Authors:
		Pengzhuo Wu
		Yao Wang
		Guodong Li
		</p>
	<p>In the digital economy era, digital inclusive finance represents a paradigmatic reconstruction of key economic information flows. This study integrates multi-source panel data of 27 cities in the Yangtze River Delta from 2011 to 2023. By constructing an economic geography composite spatial weight matrix and a nonlinear spatial panel model, this study analyzes the impact of the diffusion of digital inclusive financial information on industrial structure upgrading. The results show that: (1) digital financial inclusion exerts a significant direct effect and spatial spillover effect on industrial structure; (2) the local effect exhibits a &amp;amp;ldquo;U-shaped&amp;amp;rdquo; curve with an accelerating characteristic on the right side; the spatial spillover effect demonstrates an &amp;amp;ldquo;inverted U-shaped&amp;amp;rdquo; curve, revealing the transformation law and threshold effect of the diffusion and aggregation of digital financial information benefits; (3) digital payment and digital credit constitute the core information flows driving the coordinated upgrading of industries; and (4) entrepreneurial activity exerts a partial mediating effects, and exhibits a spatial mediating effect, while the technological innovation only demonstrates a significant local mediating effect. The findings provide quantitative evidence to support the optimization of the digital financial information ecosystem and the realization of coordinated industrial upgrading in the Yangtze River Delta.</p>
	]]></content:encoded>

	<dc:title>Research on the Nonlinear and Spatial Effects of Digital Financial Information Flow on Industrial Structure Upgrading</dc:title>
			<dc:creator>Pengzhuo Wu</dc:creator>
			<dc:creator>Yao Wang</dc:creator>
			<dc:creator>Guodong Li</dc:creator>
		<dc:identifier>doi: 10.3390/info17050510</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>510</prism:startingPage>
		<prism:doi>10.3390/info17050510</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/510</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/508">

	<title>Information, Vol. 17, Pages 508: When the Human Firewall Fails: Techno-Strain as the Hidden Link Between Technostress and Information Security Policy Violations</title>
	<link>https://www.mdpi.com/2078-2489/17/5/508</link>
	<description>In today&amp;amp;rsquo;s dynamic business environment, organizations are increasingly investing in strategies to protect themselves against information system violations. While these technologies offer remarkable benefits&amp;amp;mdash;boosting efficiency, productivity, and overall performance&amp;amp;mdash;they also bring significant risks, particularly regarding information security breaches. This study delves into the critical connections between technostress, techno-strain, and the violation of information security policies. Our research aims to shed light on how technostress, which is commonly experienced by engineers working in technology-intensive environments within the IT sector, drives information security violations. Importantly, we will also explore how techno-strain mediates this relationship. By focusing on engineers who are consistently engaged with advanced technology, we seek to answer essential questions about their experiences. It is worth noting that the requirements for information security technology can widely vary based on factors such as industry type, organizational structure, departmental roles, and cultural norms. Therefore, this study examines how technostress increases the likelihood of information security policy violations and how techno-strain mediates this relationship. Looking ahead, future research should consider both the broader institutional contexts and the individual characteristics that may shape the relationship between information security violations and technostress. Furthermore, understanding the repercussions of information security violations&amp;amp;mdash;stemming from technostress&amp;amp;mdash;on a company&amp;amp;rsquo;s financial health is vital for organizations aiming to safeguard their assets and maintain a competitive edge. Emphasizing these insights can lead to more effective strategies for managing both technology and talent in the workplace.</description>
	<pubDate>2026-05-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 508: When the Human Firewall Fails: Techno-Strain as the Hidden Link Between Technostress and Information Security Policy Violations</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/508">doi: 10.3390/info17050508</a></p>
	<p>Authors:
		Orkun Demirbağ
		Halil İbrahim Kaymak
		Hale Alan
		Ferhan Akdeniz
		</p>
	<p>In today&amp;amp;rsquo;s dynamic business environment, organizations are increasingly investing in strategies to protect themselves against information system violations. While these technologies offer remarkable benefits&amp;amp;mdash;boosting efficiency, productivity, and overall performance&amp;amp;mdash;they also bring significant risks, particularly regarding information security breaches. This study delves into the critical connections between technostress, techno-strain, and the violation of information security policies. Our research aims to shed light on how technostress, which is commonly experienced by engineers working in technology-intensive environments within the IT sector, drives information security violations. Importantly, we will also explore how techno-strain mediates this relationship. By focusing on engineers who are consistently engaged with advanced technology, we seek to answer essential questions about their experiences. It is worth noting that the requirements for information security technology can widely vary based on factors such as industry type, organizational structure, departmental roles, and cultural norms. Therefore, this study examines how technostress increases the likelihood of information security policy violations and how techno-strain mediates this relationship. Looking ahead, future research should consider both the broader institutional contexts and the individual characteristics that may shape the relationship between information security violations and technostress. Furthermore, understanding the repercussions of information security violations&amp;amp;mdash;stemming from technostress&amp;amp;mdash;on a company&amp;amp;rsquo;s financial health is vital for organizations aiming to safeguard their assets and maintain a competitive edge. Emphasizing these insights can lead to more effective strategies for managing both technology and talent in the workplace.</p>
	]]></content:encoded>

	<dc:title>When the Human Firewall Fails: Techno-Strain as the Hidden Link Between Technostress and Information Security Policy Violations</dc:title>
			<dc:creator>Orkun Demirbağ</dc:creator>
			<dc:creator>Halil İbrahim Kaymak</dc:creator>
			<dc:creator>Hale Alan</dc:creator>
			<dc:creator>Ferhan Akdeniz</dc:creator>
		<dc:identifier>doi: 10.3390/info17050508</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>508</prism:startingPage>
		<prism:doi>10.3390/info17050508</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/508</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/507">

	<title>Information, Vol. 17, Pages 507: Research on the Influencing Factors of Academic Paper Knowledge Diffusion Based on DEMATEL&amp;ndash;ISM</title>
	<link>https://www.mdpi.com/2078-2489/17/5/507</link>
	<description>(1) Background: Knowledge diffusion of academic publications has become a crucial indicator of research impact in the context of open science, yet its influencing factors and underlying mechanisms remain insufficiently studied. (2) Methods: Based on literature research, this study constructed a multi-dimensional factor system consisting of 17 factors. The DEMATEL method was used to identify the key influencing factors. The mean and standard deviation of the comprehensive influence matrix were taken as the threshold (&amp;amp;lambda; = 0.87) to filter important relationships and establish an adjacency matrix. The ISM method was used to explore the hierarchical relationship of the influencing factors, and finally, strategies were proposed. (3) Results: The results show that the journal characteristics have the highest centrality (30.292), the author characteristics have the strongest causal effect (0.686), and the language characteristics are at the bottom of the influence factor hierarchical structure model, possessing certain driving force and being closely related to multiple factors. (4) Conclusions: Effective enhancement of knowledge diffusion requires coordinated optimization across language expression, core research elements, methodological execution, dissemination channels, and presentation formats, providing theoretical and practical implications for academic evaluation and research management.</description>
	<pubDate>2026-05-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 507: Research on the Influencing Factors of Academic Paper Knowledge Diffusion Based on DEMATEL&amp;ndash;ISM</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/507">doi: 10.3390/info17050507</a></p>
	<p>Authors:
		Yidi Zhang
		Xuqiu Wei
		</p>
	<p>(1) Background: Knowledge diffusion of academic publications has become a crucial indicator of research impact in the context of open science, yet its influencing factors and underlying mechanisms remain insufficiently studied. (2) Methods: Based on literature research, this study constructed a multi-dimensional factor system consisting of 17 factors. The DEMATEL method was used to identify the key influencing factors. The mean and standard deviation of the comprehensive influence matrix were taken as the threshold (&amp;amp;lambda; = 0.87) to filter important relationships and establish an adjacency matrix. The ISM method was used to explore the hierarchical relationship of the influencing factors, and finally, strategies were proposed. (3) Results: The results show that the journal characteristics have the highest centrality (30.292), the author characteristics have the strongest causal effect (0.686), and the language characteristics are at the bottom of the influence factor hierarchical structure model, possessing certain driving force and being closely related to multiple factors. (4) Conclusions: Effective enhancement of knowledge diffusion requires coordinated optimization across language expression, core research elements, methodological execution, dissemination channels, and presentation formats, providing theoretical and practical implications for academic evaluation and research management.</p>
	]]></content:encoded>

	<dc:title>Research on the Influencing Factors of Academic Paper Knowledge Diffusion Based on DEMATEL&amp;amp;ndash;ISM</dc:title>
			<dc:creator>Yidi Zhang</dc:creator>
			<dc:creator>Xuqiu Wei</dc:creator>
		<dc:identifier>doi: 10.3390/info17050507</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>507</prism:startingPage>
		<prism:doi>10.3390/info17050507</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/507</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/506">

	<title>Information, Vol. 17, Pages 506: SymbolicAnalysis and LLM-Guided Debugging of Digital Twin Models with ASP Chef and DTDL</title>
	<link>https://www.mdpi.com/2078-2489/17/5/506</link>
	<description>DTDL (Digital Twins Definition Language) provides no mechanism for logical reasoning or constraint checking over digital twin models. We integrate DTDL with ASP Chef, a web-based Answer Set Programming (ASP) platform, via a structured DTDL-to-ASP mapping and three dedicated operations: @DTDL/Parse for fact generation, @DTDL/Analysis for structural metrics, and @DTDL/Debug for symbolic validation with LLM-guided repair. The key design decision is that error detection is symbolic and deterministic within the implemented set of constraint classes; a language model is invoked only after the ASP layer has produced a concrete, grounded diagnostic, keeping the correctness boundary with the symbolic layer. Soundness and completeness guarantees are scoped to these constraint classes; a formal proof is left as future work. We illustrate the framework on two agricultural use cases and report a proof-of-concept assessment on 99 diagnostics spanning 21 error classes across four domains. Three binary metrics are used: json_valid and entity_recall are computed mechanically; fix quality (judge_correct) is assessed by an independent LLM judge (Claude Sonnet 4.6). The complete grounded workflow achieves 90% judge_correct and 86% json_valid; a fair ablation baseline&amp;amp;mdash;same LLM and system message, but error type and entity name in natural language without structured diagnostics&amp;amp;mdash;achieves 77% and 75%, respectively. The gap is consistent across three independent judges and statistically significant (McNemar p&amp;amp;lt;0.01), but the inter-judge reliability of judge_correct is limited (&amp;amp;kappa; ranging from 0.00 to 0.44), so results should be read as directional evidence rather than precise effect estimates. Excluding the dominant isolated_interface class (n=28, ceiling score), the conservative estimate is 87% vs. 79% on the remaining 71 diagnostics. These results constitute a preliminary proof-of-concept limited to a small number of models, a few application domains, and a single LLM configuration; results do not generalize beyond this specific setting. The judge_correct metric is assessed by LLM-as-judge and does not carry a perfect inter-annotator agreement.</description>
	<pubDate>2026-05-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 506: SymbolicAnalysis and LLM-Guided Debugging of Digital Twin Models with ASP Chef and DTDL</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/506">doi: 10.3390/info17050506</a></p>
	<p>Authors:
		Mario Alviano
		Paola Guarasci
		</p>
	<p>DTDL (Digital Twins Definition Language) provides no mechanism for logical reasoning or constraint checking over digital twin models. We integrate DTDL with ASP Chef, a web-based Answer Set Programming (ASP) platform, via a structured DTDL-to-ASP mapping and three dedicated operations: @DTDL/Parse for fact generation, @DTDL/Analysis for structural metrics, and @DTDL/Debug for symbolic validation with LLM-guided repair. The key design decision is that error detection is symbolic and deterministic within the implemented set of constraint classes; a language model is invoked only after the ASP layer has produced a concrete, grounded diagnostic, keeping the correctness boundary with the symbolic layer. Soundness and completeness guarantees are scoped to these constraint classes; a formal proof is left as future work. We illustrate the framework on two agricultural use cases and report a proof-of-concept assessment on 99 diagnostics spanning 21 error classes across four domains. Three binary metrics are used: json_valid and entity_recall are computed mechanically; fix quality (judge_correct) is assessed by an independent LLM judge (Claude Sonnet 4.6). The complete grounded workflow achieves 90% judge_correct and 86% json_valid; a fair ablation baseline&amp;amp;mdash;same LLM and system message, but error type and entity name in natural language without structured diagnostics&amp;amp;mdash;achieves 77% and 75%, respectively. The gap is consistent across three independent judges and statistically significant (McNemar p&amp;amp;lt;0.01), but the inter-judge reliability of judge_correct is limited (&amp;amp;kappa; ranging from 0.00 to 0.44), so results should be read as directional evidence rather than precise effect estimates. Excluding the dominant isolated_interface class (n=28, ceiling score), the conservative estimate is 87% vs. 79% on the remaining 71 diagnostics. These results constitute a preliminary proof-of-concept limited to a small number of models, a few application domains, and a single LLM configuration; results do not generalize beyond this specific setting. The judge_correct metric is assessed by LLM-as-judge and does not carry a perfect inter-annotator agreement.</p>
	]]></content:encoded>

	<dc:title>SymbolicAnalysis and LLM-Guided Debugging of Digital Twin Models with ASP Chef and DTDL</dc:title>
			<dc:creator>Mario Alviano</dc:creator>
			<dc:creator>Paola Guarasci</dc:creator>
		<dc:identifier>doi: 10.3390/info17050506</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>506</prism:startingPage>
		<prism:doi>10.3390/info17050506</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/506</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/505">

	<title>Information, Vol. 17, Pages 505: LLM-as-a-Grader: Practical Insights from Large Language Models for Short-Answer and Report Evaluation</title>
	<link>https://www.mdpi.com/2078-2489/17/5/505</link>
	<description>Large Language Models (LLMs) are increasingly explored for educational tasks such as grading, yet their alignment with human evaluation in real classrooms remains underexamined. In this study, we investigate the feasibility of using OpenAI GPT-4o to evaluate short-answer quizzes and project reports in an undergraduate Computational Linguistics course. We collect responses from approximately 50 students across five quizzes and receive project reports from 14 teams. LLM-generated scores are compared against human evaluations conducted independently by the course teaching assistants (TAs). Our results show that GPT-4o achieves strong correlation with human graders (up to 0.98) and exact score agreement in 55% of quiz cases. For project reports, it also shows strong overall alignment with human grading, while exhibiting some variability in scoring technical, open-ended responses. We release all code and sample data to support further research on LLMs in educational assessment. This work highlights both the potential and limitations of LLM-based grading systems and contributes to advancing automated grading in real-world academic settings.</description>
	<pubDate>2026-05-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 505: LLM-as-a-Grader: Practical Insights from Large Language Models for Short-Answer and Report Evaluation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/505">doi: 10.3390/info17050505</a></p>
	<p>Authors:
		Grace Byun
		Swati Rajwal
		Jinho D. Choi
		</p>
	<p>Large Language Models (LLMs) are increasingly explored for educational tasks such as grading, yet their alignment with human evaluation in real classrooms remains underexamined. In this study, we investigate the feasibility of using OpenAI GPT-4o to evaluate short-answer quizzes and project reports in an undergraduate Computational Linguistics course. We collect responses from approximately 50 students across five quizzes and receive project reports from 14 teams. LLM-generated scores are compared against human evaluations conducted independently by the course teaching assistants (TAs). Our results show that GPT-4o achieves strong correlation with human graders (up to 0.98) and exact score agreement in 55% of quiz cases. For project reports, it also shows strong overall alignment with human grading, while exhibiting some variability in scoring technical, open-ended responses. We release all code and sample data to support further research on LLMs in educational assessment. This work highlights both the potential and limitations of LLM-based grading systems and contributes to advancing automated grading in real-world academic settings.</p>
	]]></content:encoded>

	<dc:title>LLM-as-a-Grader: Practical Insights from Large Language Models for Short-Answer and Report Evaluation</dc:title>
			<dc:creator>Grace Byun</dc:creator>
			<dc:creator>Swati Rajwal</dc:creator>
			<dc:creator>Jinho D. Choi</dc:creator>
		<dc:identifier>doi: 10.3390/info17050505</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>505</prism:startingPage>
		<prism:doi>10.3390/info17050505</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/505</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/504">

	<title>Information, Vol. 17, Pages 504: On the Use of Biased-Randomized Transformers as Data-Driven Heuristics for Agile Optimization</title>
	<link>https://www.mdpi.com/2078-2489/17/5/504</link>
	<description>This paper proposes the concept of biased-randomized transformers, a novel methodology that combines biased-randomized techniques and transformer-based deep learning for &amp;amp;lsquo;agile&amp;amp;rsquo; optimization (i.e., real-time optimization that is carried out iteratively in dynamic systems). On the one hand, biased-randomization techniques have been used in the past to inject controlled randomness into greedy heuristics, thus converting them into probabilistic algorithms capable of generating thousands of good-quality solutions while preserving heuristic logic. On the other hand, transformer models can capture complex patterns across thousands of variables. Once trained, these models can be seen as data-driven heuristics able to provide fast solutions to new instances and adapt to changing inputs. The combination of biased-randomization techniques with trained transformers allows for a fast exploration and selection of the high-quality solutions to NP-hard combinatorial optimization problems. The paper includes two case studies that illustrate the potential of these biased-randomized transformers.</description>
	<pubDate>2026-05-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 504: On the Use of Biased-Randomized Transformers as Data-Driven Heuristics for Agile Optimization</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/504">doi: 10.3390/info17050504</a></p>
	<p>Authors:
		Angel A. Juan
		Antoni Guerrero
		Marc Escoto
		Javier Panadero
		Alvaro Garcia-Sanchez
		Mauricio G. C. Resende
		</p>
	<p>This paper proposes the concept of biased-randomized transformers, a novel methodology that combines biased-randomized techniques and transformer-based deep learning for &amp;amp;lsquo;agile&amp;amp;rsquo; optimization (i.e., real-time optimization that is carried out iteratively in dynamic systems). On the one hand, biased-randomization techniques have been used in the past to inject controlled randomness into greedy heuristics, thus converting them into probabilistic algorithms capable of generating thousands of good-quality solutions while preserving heuristic logic. On the other hand, transformer models can capture complex patterns across thousands of variables. Once trained, these models can be seen as data-driven heuristics able to provide fast solutions to new instances and adapt to changing inputs. The combination of biased-randomization techniques with trained transformers allows for a fast exploration and selection of the high-quality solutions to NP-hard combinatorial optimization problems. The paper includes two case studies that illustrate the potential of these biased-randomized transformers.</p>
	]]></content:encoded>

	<dc:title>On the Use of Biased-Randomized Transformers as Data-Driven Heuristics for Agile Optimization</dc:title>
			<dc:creator>Angel A. Juan</dc:creator>
			<dc:creator>Antoni Guerrero</dc:creator>
			<dc:creator>Marc Escoto</dc:creator>
			<dc:creator>Javier Panadero</dc:creator>
			<dc:creator>Alvaro Garcia-Sanchez</dc:creator>
			<dc:creator>Mauricio G. C. Resende</dc:creator>
		<dc:identifier>doi: 10.3390/info17050504</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>504</prism:startingPage>
		<prism:doi>10.3390/info17050504</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/504</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/503">

	<title>Information, Vol. 17, Pages 503: Positioning Artificial Intelligence Research in East Asia and Latin America: A Comparative Bibliometric Analysis</title>
	<link>https://www.mdpi.com/2078-2489/17/5/503</link>
	<description>This study aims to provide a comprehensive cross-regional bibliometric analysis of artificial intelligence (AI) research in East Asia and Latin America from 2020 to 2025. By quantifying publication trends, authorship, institutional productivity, collaboration networks, and citation impact, the research seeks to identify regional leaders, thematic clusters, and disparities in visibility and impact between these two regions. Design/methodology/approach; Scopus-indexed publications containing the phrases &amp;amp;ldquo;artificial intelligence research&amp;amp;rdquo; or &amp;amp;ldquo;artificial intelligence innovation&amp;amp;rdquo; in their title, abstract, or keywords were retrieved for the period 2020&amp;amp;ndash;2025. Inclusion criteria required at least one author&amp;amp;rsquo;s affiliation in any of the fourteen specified countries across East Asia or Latin America. All document types (articles, reviews, conference papers, book chapters) were considered. Metadata were manually extracted from Scopus database ranking to identify the top-cited papers, most prolific authors, leading institutions, thematic and subject-area concentrations, and crossnational collaboration patterns. Findings; this bibliometric review clarifies the dynamic trajectory of AI research in East Asia and Latin America, revealing significant disparities in productivity, visibility, and thematic focus. The findings underscore the need for targeted investments in research capacity building, strategic international partnerships, and thematic realignment particularly for Latin America to enhance global visibility and align with emerging AI trends. Originality; by contrasting two understudied regions (East Asia vs. Latin America), we capture shifts in the AI landscape&amp;amp;mdash;specifically, the generative AI boom across subfields and regions that no single region or pre 2022 study can. By highlighting structural disparities in productivity, citation impact, and institutional support, it offers policymakers, funding agencies, and academic leaders novel insights.</description>
	<pubDate>2026-05-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 503: Positioning Artificial Intelligence Research in East Asia and Latin America: A Comparative Bibliometric Analysis</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/503">doi: 10.3390/info17050503</a></p>
	<p>Authors:
		Joaquim Jose Carvalho Proença
		Nelson Jesús Campos Rosendo
		Soratna Veronica Navas Gotopo
		</p>
	<p>This study aims to provide a comprehensive cross-regional bibliometric analysis of artificial intelligence (AI) research in East Asia and Latin America from 2020 to 2025. By quantifying publication trends, authorship, institutional productivity, collaboration networks, and citation impact, the research seeks to identify regional leaders, thematic clusters, and disparities in visibility and impact between these two regions. Design/methodology/approach; Scopus-indexed publications containing the phrases &amp;amp;ldquo;artificial intelligence research&amp;amp;rdquo; or &amp;amp;ldquo;artificial intelligence innovation&amp;amp;rdquo; in their title, abstract, or keywords were retrieved for the period 2020&amp;amp;ndash;2025. Inclusion criteria required at least one author&amp;amp;rsquo;s affiliation in any of the fourteen specified countries across East Asia or Latin America. All document types (articles, reviews, conference papers, book chapters) were considered. Metadata were manually extracted from Scopus database ranking to identify the top-cited papers, most prolific authors, leading institutions, thematic and subject-area concentrations, and crossnational collaboration patterns. Findings; this bibliometric review clarifies the dynamic trajectory of AI research in East Asia and Latin America, revealing significant disparities in productivity, visibility, and thematic focus. The findings underscore the need for targeted investments in research capacity building, strategic international partnerships, and thematic realignment particularly for Latin America to enhance global visibility and align with emerging AI trends. Originality; by contrasting two understudied regions (East Asia vs. Latin America), we capture shifts in the AI landscape&amp;amp;mdash;specifically, the generative AI boom across subfields and regions that no single region or pre 2022 study can. By highlighting structural disparities in productivity, citation impact, and institutional support, it offers policymakers, funding agencies, and academic leaders novel insights.</p>
	]]></content:encoded>

	<dc:title>Positioning Artificial Intelligence Research in East Asia and Latin America: A Comparative Bibliometric Analysis</dc:title>
			<dc:creator>Joaquim Jose Carvalho Proença</dc:creator>
			<dc:creator>Nelson Jesús Campos Rosendo</dc:creator>
			<dc:creator>Soratna Veronica Navas Gotopo</dc:creator>
		<dc:identifier>doi: 10.3390/info17050503</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>503</prism:startingPage>
		<prism:doi>10.3390/info17050503</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/503</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/501">

	<title>Information, Vol. 17, Pages 501: Validating Large Language Models for Title-Abstract Screening in Low-Prevalence Systematic Reviews: An Environmental Science Case Study</title>
	<link>https://www.mdpi.com/2078-2489/17/5/501</link>
	<description>Literature screening is a major bottleneck in systematic reviews, yet Large Language Models (LLMs) can substantially reduce workloads. However, performance varies across models and is sensitive to evaluation metrics, particularly in low-prevalence screening contexts. We validated five LLMs (GPT-4.1, Claude 3.5 Sonnet, Gemini 2.0 Flash, DeepSeek V3, and Mistral Large) against a 500-record gold-standard dataset (8 inclusions; 1.6% prevalence) using a conservative zero-shot prompt aligned with standard systematic review workflows. Performance was assessed through classification metrics (sensitivity, specificity, precision), logistic regression (GLM; Firth-penalised where separation occurred), and agreement indices (Cohen&amp;amp;rsquo;s &amp;amp;kappa;, MCC, PABAK, Gwet&amp;amp;rsquo;s AC1). Gemini 2.0 Flash and Mistral Large showed no false negatives (1.00) but differed in specificity (0.858 vs. 0.697) and accuracy (0.860 vs. 0.702). GPT-4.1 and Claude 3.5 Sonnet performed identically (sensitivity 0.875; specificity 0.876; accuracy 0.876). In contrast, DeepSeek V3 maximised specificity (0.980) and accuracy (0.970) but demonstrated lower sensitivity (0.375). Regression analyses confirmed strong positive associations with human decisions (OR 28.9&amp;amp;ndash;49.5). Agreement indices revealed the expected low-prevalence artefact, with Cohen&amp;amp;rsquo;s &amp;amp;kappa; low despite high concordance while MCC, PABAK, and AC1 indicated substantially stronger agreement. Our results highlight a fundamental sensitivity-specificity trade-off, with conclusions dependent on the evaluation framework chosen. LLMs may meaningfully support title-abstract screening as decision-support tools, provided that human oversight is maintained and validation is transparent and reproducible.</description>
	<pubDate>2026-05-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 501: Validating Large Language Models for Title-Abstract Screening in Low-Prevalence Systematic Reviews: An Environmental Science Case Study</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/501">doi: 10.3390/info17050501</a></p>
	<p>Authors:
		Maximilian Nawrath
		Andrea Merlina
		Jemmima Knight
		Sam A. Welch
		Mahla Rashidian
		Isabel Seifert-Dähnn
		</p>
	<p>Literature screening is a major bottleneck in systematic reviews, yet Large Language Models (LLMs) can substantially reduce workloads. However, performance varies across models and is sensitive to evaluation metrics, particularly in low-prevalence screening contexts. We validated five LLMs (GPT-4.1, Claude 3.5 Sonnet, Gemini 2.0 Flash, DeepSeek V3, and Mistral Large) against a 500-record gold-standard dataset (8 inclusions; 1.6% prevalence) using a conservative zero-shot prompt aligned with standard systematic review workflows. Performance was assessed through classification metrics (sensitivity, specificity, precision), logistic regression (GLM; Firth-penalised where separation occurred), and agreement indices (Cohen&amp;amp;rsquo;s &amp;amp;kappa;, MCC, PABAK, Gwet&amp;amp;rsquo;s AC1). Gemini 2.0 Flash and Mistral Large showed no false negatives (1.00) but differed in specificity (0.858 vs. 0.697) and accuracy (0.860 vs. 0.702). GPT-4.1 and Claude 3.5 Sonnet performed identically (sensitivity 0.875; specificity 0.876; accuracy 0.876). In contrast, DeepSeek V3 maximised specificity (0.980) and accuracy (0.970) but demonstrated lower sensitivity (0.375). Regression analyses confirmed strong positive associations with human decisions (OR 28.9&amp;amp;ndash;49.5). Agreement indices revealed the expected low-prevalence artefact, with Cohen&amp;amp;rsquo;s &amp;amp;kappa; low despite high concordance while MCC, PABAK, and AC1 indicated substantially stronger agreement. Our results highlight a fundamental sensitivity-specificity trade-off, with conclusions dependent on the evaluation framework chosen. LLMs may meaningfully support title-abstract screening as decision-support tools, provided that human oversight is maintained and validation is transparent and reproducible.</p>
	]]></content:encoded>

	<dc:title>Validating Large Language Models for Title-Abstract Screening in Low-Prevalence Systematic Reviews: An Environmental Science Case Study</dc:title>
			<dc:creator>Maximilian Nawrath</dc:creator>
			<dc:creator>Andrea Merlina</dc:creator>
			<dc:creator>Jemmima Knight</dc:creator>
			<dc:creator>Sam A. Welch</dc:creator>
			<dc:creator>Mahla Rashidian</dc:creator>
			<dc:creator>Isabel Seifert-Dähnn</dc:creator>
		<dc:identifier>doi: 10.3390/info17050501</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-19</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-19</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>501</prism:startingPage>
		<prism:doi>10.3390/info17050501</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/501</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/502">

	<title>Information, Vol. 17, Pages 502: Research on the Long-Term Mechanism of Digital Transformation in High-End Equipment Manufacturing Based on a Four-Party Evolutionary Game</title>
	<link>https://www.mdpi.com/2078-2489/17/5/502</link>
	<description>The digital transformation of high-end equipment is not only a critical means to enhance national core competitiveness, but also a necessary requirement within the framework of national development strategy. Major stakeholders in this transformation include local governments, high-end equipment manufacturers, financial institutions, and industrial technology platforms, all of whose interactions significantly influence the transformation process. This paper constructs a four-party evolutionary game model involving local governments, high-end equipment manufacturers, financial support institutions, and industrial technology platforms. Numerical simulations are conducted to analyze the stable strategies and evolutionary trends of these four players under various parameters, while also exploring the long-term mechanisms for the digital transformation of high-end equipment facilitated by government subsidies. The results indicate that in the initial stage of digital transformation, the government assumes a leading role by implementing high-subsidy policies to encourage participation from manufacturers, financial institutions, and technology platforms. As the transformation progresses into a stable promotion phase, the government gradually reduces subsidies to a normal level and increasingly relies on market mechanisms to foster active engagement. Both models represent ideal scenarios for the digital transformation of high-end equipment. Finally, this paper offers relevant policy recommendations aimed at enhancing policy guidance, stimulating the motivation of market entities, and improving the benefit linkage mechanism among all four stakeholders.</description>
	<pubDate>2026-05-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 502: Research on the Long-Term Mechanism of Digital Transformation in High-End Equipment Manufacturing Based on a Four-Party Evolutionary Game</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/502">doi: 10.3390/info17050502</a></p>
	<p>Authors:
		Xi Zhao
		Jungang Yang
		</p>
	<p>The digital transformation of high-end equipment is not only a critical means to enhance national core competitiveness, but also a necessary requirement within the framework of national development strategy. Major stakeholders in this transformation include local governments, high-end equipment manufacturers, financial institutions, and industrial technology platforms, all of whose interactions significantly influence the transformation process. This paper constructs a four-party evolutionary game model involving local governments, high-end equipment manufacturers, financial support institutions, and industrial technology platforms. Numerical simulations are conducted to analyze the stable strategies and evolutionary trends of these four players under various parameters, while also exploring the long-term mechanisms for the digital transformation of high-end equipment facilitated by government subsidies. The results indicate that in the initial stage of digital transformation, the government assumes a leading role by implementing high-subsidy policies to encourage participation from manufacturers, financial institutions, and technology platforms. As the transformation progresses into a stable promotion phase, the government gradually reduces subsidies to a normal level and increasingly relies on market mechanisms to foster active engagement. Both models represent ideal scenarios for the digital transformation of high-end equipment. Finally, this paper offers relevant policy recommendations aimed at enhancing policy guidance, stimulating the motivation of market entities, and improving the benefit linkage mechanism among all four stakeholders.</p>
	]]></content:encoded>

	<dc:title>Research on the Long-Term Mechanism of Digital Transformation in High-End Equipment Manufacturing Based on a Four-Party Evolutionary Game</dc:title>
			<dc:creator>Xi Zhao</dc:creator>
			<dc:creator>Jungang Yang</dc:creator>
		<dc:identifier>doi: 10.3390/info17050502</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-19</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-19</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>502</prism:startingPage>
		<prism:doi>10.3390/info17050502</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/502</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/500">

	<title>Information, Vol. 17, Pages 500: Applying Integrated Delphi&amp;ndash;AHP to Maintenance Competency Prioritization in Industry 4.0: A Formally Specified Group Decision Framework with Consistency and Sensitivity Diagnostics</title>
	<link>https://www.mdpi.com/2078-2489/17/5/500</link>
	<description>As Industry 4.0 transforms manufacturing operations, maintenance organizations face a group decision-making problem: how to consolidate diverse expert judgments into a defensible, transparent ranking of the competencies that maintenance personnel most need. This paper applies an integrated Delphi&amp;amp;ndash;AHP framework&amp;amp;mdash;with explicit notation, operators, and diagnostics&amp;amp;mdash;to prioritize maintenance competencies in advanced-manufacturing settings. The Delphi stage consolidates expert-generated items under median&amp;amp;ndash;interquartile-range consensus and round-to-round stability rules, while the Analytic Hierarchy Process (AHP) transforms validated pairwise comparisons into ratio-scale priority weights through geometric-mean Aggregation of Individual Judgments (AIJ) and eigenvector derivation. Consistency screening (CI/CR), inter-rater agreement (Kendall&amp;amp;rsquo;s W), and perturbation-based sensitivity analysis accompany the resulting weight vector. A bounded AI-assisted consistency-check step supports terminology harmonization during Delphi statement consolidation, subject to explicit human-validation constraints. A panel of fifteen industry experts participated in the study; five competency dimensions and twenty-nine indicators were retained through three Delphi rounds. AHP weighting identified Basic Knowledge and Skills as the highest-priority dimension, followed by Safety and Regulation Awareness and Problem-Solving Ability. Aggregated pairwise comparison matrices, local and global weights, and sensitivity results are reported to support reproducibility. The study contributes a rigorously specified application of combined Delphi&amp;amp;ndash;AHP to a domain&amp;amp;mdash;Industry 4.0 maintenance asset management&amp;amp;mdash;where multi-criteria decision analysis has seen limited formal application, and closes common specification gaps in published Delphi&amp;amp;ndash;AHP implementations.</description>
	<pubDate>2026-05-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 500: Applying Integrated Delphi&amp;ndash;AHP to Maintenance Competency Prioritization in Industry 4.0: A Formally Specified Group Decision Framework with Consistency and Sensitivity Diagnostics</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/500">doi: 10.3390/info17050500</a></p>
	<p>Authors:
		Chin-Wen Liao
		Nguyen Van Thanh
		Yi-Hsin Tai
		</p>
	<p>As Industry 4.0 transforms manufacturing operations, maintenance organizations face a group decision-making problem: how to consolidate diverse expert judgments into a defensible, transparent ranking of the competencies that maintenance personnel most need. This paper applies an integrated Delphi&amp;amp;ndash;AHP framework&amp;amp;mdash;with explicit notation, operators, and diagnostics&amp;amp;mdash;to prioritize maintenance competencies in advanced-manufacturing settings. The Delphi stage consolidates expert-generated items under median&amp;amp;ndash;interquartile-range consensus and round-to-round stability rules, while the Analytic Hierarchy Process (AHP) transforms validated pairwise comparisons into ratio-scale priority weights through geometric-mean Aggregation of Individual Judgments (AIJ) and eigenvector derivation. Consistency screening (CI/CR), inter-rater agreement (Kendall&amp;amp;rsquo;s W), and perturbation-based sensitivity analysis accompany the resulting weight vector. A bounded AI-assisted consistency-check step supports terminology harmonization during Delphi statement consolidation, subject to explicit human-validation constraints. A panel of fifteen industry experts participated in the study; five competency dimensions and twenty-nine indicators were retained through three Delphi rounds. AHP weighting identified Basic Knowledge and Skills as the highest-priority dimension, followed by Safety and Regulation Awareness and Problem-Solving Ability. Aggregated pairwise comparison matrices, local and global weights, and sensitivity results are reported to support reproducibility. The study contributes a rigorously specified application of combined Delphi&amp;amp;ndash;AHP to a domain&amp;amp;mdash;Industry 4.0 maintenance asset management&amp;amp;mdash;where multi-criteria decision analysis has seen limited formal application, and closes common specification gaps in published Delphi&amp;amp;ndash;AHP implementations.</p>
	]]></content:encoded>

	<dc:title>Applying Integrated Delphi&amp;amp;ndash;AHP to Maintenance Competency Prioritization in Industry 4.0: A Formally Specified Group Decision Framework with Consistency and Sensitivity Diagnostics</dc:title>
			<dc:creator>Chin-Wen Liao</dc:creator>
			<dc:creator>Nguyen Van Thanh</dc:creator>
			<dc:creator>Yi-Hsin Tai</dc:creator>
		<dc:identifier>doi: 10.3390/info17050500</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-19</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-19</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>500</prism:startingPage>
		<prism:doi>10.3390/info17050500</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/500</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/499">

	<title>Information, Vol. 17, Pages 499: Tamper-Evident Data and Model Provenance for IoT-Based Machine Learning Using Blockchain and Off-Chain Storage</title>
	<link>https://www.mdpi.com/2078-2489/17/5/499</link>
	<description>Machine learning models increasingly rely on continuously generated sensor data for automated decision-making in Internet of Things (IoT) environments. The distributed and often insecure nature of IoT infrastructures introduces risks related to data manipulation, lack of traceability, and unverifiable model evolution. Existing solutions typically address isolated aspects such as data security or access control but do not provide end-to-end provenance across the machine learning lifecycle. This paper proposes a tamper-evident data and model provenance framework for IoT-based machine learning that integrates blockchain with off-chain storage. The framework records cryptographic hashes and metadata of data, preprocessing outputs, and trained models on-chain while maintaining large artifacts off-chain to ensure scalability. Smart contracts establish verifiable linkage among lifecycle artifacts and automate provenance registration. The framework is evaluated in a simulated IoT&amp;amp;ndash;ML pipeline under integrity attack scenarios including data manipulation, model tampering, and metadata modification. Experimental results demonstrate reliable detection of unauthorized modifications with low verification latency and constant on-chain storage per record under controlled conditions. These findings indicate the feasibility of hybrid blockchain architectures for tamper-evident provenance in IoT-based machine learning systems, while highlighting the need for further validation in real-world deployments.</description>
	<pubDate>2026-05-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 499: Tamper-Evident Data and Model Provenance for IoT-Based Machine Learning Using Blockchain and Off-Chain Storage</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/499">doi: 10.3390/info17050499</a></p>
	<p>Authors:
		Sangheethaa Sukumaran
		Arun Korath
		Gowri Arun Menon
		</p>
	<p>Machine learning models increasingly rely on continuously generated sensor data for automated decision-making in Internet of Things (IoT) environments. The distributed and often insecure nature of IoT infrastructures introduces risks related to data manipulation, lack of traceability, and unverifiable model evolution. Existing solutions typically address isolated aspects such as data security or access control but do not provide end-to-end provenance across the machine learning lifecycle. This paper proposes a tamper-evident data and model provenance framework for IoT-based machine learning that integrates blockchain with off-chain storage. The framework records cryptographic hashes and metadata of data, preprocessing outputs, and trained models on-chain while maintaining large artifacts off-chain to ensure scalability. Smart contracts establish verifiable linkage among lifecycle artifacts and automate provenance registration. The framework is evaluated in a simulated IoT&amp;amp;ndash;ML pipeline under integrity attack scenarios including data manipulation, model tampering, and metadata modification. Experimental results demonstrate reliable detection of unauthorized modifications with low verification latency and constant on-chain storage per record under controlled conditions. These findings indicate the feasibility of hybrid blockchain architectures for tamper-evident provenance in IoT-based machine learning systems, while highlighting the need for further validation in real-world deployments.</p>
	]]></content:encoded>

	<dc:title>Tamper-Evident Data and Model Provenance for IoT-Based Machine Learning Using Blockchain and Off-Chain Storage</dc:title>
			<dc:creator>Sangheethaa Sukumaran</dc:creator>
			<dc:creator>Arun Korath</dc:creator>
			<dc:creator>Gowri Arun Menon</dc:creator>
		<dc:identifier>doi: 10.3390/info17050499</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-19</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-19</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>499</prism:startingPage>
		<prism:doi>10.3390/info17050499</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/499</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/498">

	<title>Information, Vol. 17, Pages 498: Investigating the Structural Properties of Linguistic Biases in Multilingual Language Models</title>
	<link>https://www.mdpi.com/2078-2489/17/5/498</link>
	<description>As large language models (LLMs) scale to cover more languages, their potential to support low-resource settings becomes increasingly promising. However, the mechanisms underlying cross-lingual transfer and the factors that facilitate it remain insufficiently understood. Prior work has highlighted the role of linguistic similarity&amp;amp;mdash;particularly syntactic structure&amp;amp;mdash;in enabling transfer across languages. In this study, we present a broad empirical analysis of how multilingual LLMs encode and relate structural information across languages with varying typological properties. We combine multiple complementary methods, including hidden-state similarity analysis, typological correlation, probing for syntactic features, and attention-based structural comparisons, across four multilingual models and thirteen languages. Our findings show consistent correlations between representational similarity and syntactic relatedness, suggesting that structural properties of language influence how information is organized and shared across languages. We further observe that attention-derived structures exhibit partial alignment with gold-standard syntax, though this alignment should be interpreted as heuristic rather than direct evidence of syntactic encoding. Overall, our results provide a comparative empirical perspective on cross-lingual structural bias in multilingual LLMs and highlight the importance of careful methodological interpretation when linking representation geometry to linguistic structure.</description>
	<pubDate>2026-05-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 498: Investigating the Structural Properties of Linguistic Biases in Multilingual Language Models</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/498">doi: 10.3390/info17050498</a></p>
	<p>Authors:
		Raghav Mantri
		Saun Chen
		Yixuan Wang
		Duygu Ataman
		</p>
	<p>As large language models (LLMs) scale to cover more languages, their potential to support low-resource settings becomes increasingly promising. However, the mechanisms underlying cross-lingual transfer and the factors that facilitate it remain insufficiently understood. Prior work has highlighted the role of linguistic similarity&amp;amp;mdash;particularly syntactic structure&amp;amp;mdash;in enabling transfer across languages. In this study, we present a broad empirical analysis of how multilingual LLMs encode and relate structural information across languages with varying typological properties. We combine multiple complementary methods, including hidden-state similarity analysis, typological correlation, probing for syntactic features, and attention-based structural comparisons, across four multilingual models and thirteen languages. Our findings show consistent correlations between representational similarity and syntactic relatedness, suggesting that structural properties of language influence how information is organized and shared across languages. We further observe that attention-derived structures exhibit partial alignment with gold-standard syntax, though this alignment should be interpreted as heuristic rather than direct evidence of syntactic encoding. Overall, our results provide a comparative empirical perspective on cross-lingual structural bias in multilingual LLMs and highlight the importance of careful methodological interpretation when linking representation geometry to linguistic structure.</p>
	]]></content:encoded>

	<dc:title>Investigating the Structural Properties of Linguistic Biases in Multilingual Language Models</dc:title>
			<dc:creator>Raghav Mantri</dc:creator>
			<dc:creator>Saun Chen</dc:creator>
			<dc:creator>Yixuan Wang</dc:creator>
			<dc:creator>Duygu Ataman</dc:creator>
		<dc:identifier>doi: 10.3390/info17050498</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-18</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-18</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>498</prism:startingPage>
		<prism:doi>10.3390/info17050498</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/498</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/497">

	<title>Information, Vol. 17, Pages 497: Multi-Agent System-Based Real-Time Implementation of Advanced Energy Management in Hybrid Microgrids</title>
	<link>https://www.mdpi.com/2078-2489/17/5/497</link>
	<description>The growing integration of solar, wind and battery energy storage (BES) of the microgrids (MGs) has increased the necessity of real-time energy management, especially in the multi-microgrid (multi-MG) setting, where the generation and the load change stochastically. This paper presents a Java Agent DEvelopment (JADE)-based Multi-Agent System (MAS) for real-time energy management of a low-voltage hybrid multi-MG system incorporating solar photovoltaic (PV), wind generation, and battery energy storage (BES). The proposed framework&amp;amp;rsquo;s novelty lies in its physical campus-scale hardware deployment&amp;amp;mdash;validated across four operating scenarios (single MG off-grid, single MG on-grid, dual MG off-grid, and dual MG on-grid)&amp;amp;mdash;combined with autonomous inter-MG power sharing, which distinguishes it from existing simulation-only MAS-based microgrid studies. The suggested framework facilitates decentralized communication between interconnected MGs and the utility AC grid to facilitate the proper management of power flow, its exchange, and the reliability of the system. The intelligent agents are used to coordinate solar, wind, BES, and load changes in order to adjust to changing demand conditions. The system is physically implemented on a campus rooftop with two 1 kW solar PV arrays and two 1.5 kW wind turbine generators, each paired with a 24 V, 150 Ah battery bank, operating on a 24 V DC bus. Results across 24 h real operational profiles demonstrate effective power balance maintenance, renewable energy maximization, and constraint-compliant battery operation (SOC is bounded within 20&amp;amp;ndash;90%). A direct comparison with a conventional centralized JavaScript-based EMS confirms equivalent dispatch accuracy while demonstrating superior scalability, fault tolerance, and modularity of the proposed JADE MAS architecture.</description>
	<pubDate>2026-05-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 497: Multi-Agent System-Based Real-Time Implementation of Advanced Energy Management in Hybrid Microgrids</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/497">doi: 10.3390/info17050497</a></p>
	<p>Authors:
		Praveen Kumar Reddy Kudumula
		P. Balachennaiah
		</p>
	<p>The growing integration of solar, wind and battery energy storage (BES) of the microgrids (MGs) has increased the necessity of real-time energy management, especially in the multi-microgrid (multi-MG) setting, where the generation and the load change stochastically. This paper presents a Java Agent DEvelopment (JADE)-based Multi-Agent System (MAS) for real-time energy management of a low-voltage hybrid multi-MG system incorporating solar photovoltaic (PV), wind generation, and battery energy storage (BES). The proposed framework&amp;amp;rsquo;s novelty lies in its physical campus-scale hardware deployment&amp;amp;mdash;validated across four operating scenarios (single MG off-grid, single MG on-grid, dual MG off-grid, and dual MG on-grid)&amp;amp;mdash;combined with autonomous inter-MG power sharing, which distinguishes it from existing simulation-only MAS-based microgrid studies. The suggested framework facilitates decentralized communication between interconnected MGs and the utility AC grid to facilitate the proper management of power flow, its exchange, and the reliability of the system. The intelligent agents are used to coordinate solar, wind, BES, and load changes in order to adjust to changing demand conditions. The system is physically implemented on a campus rooftop with two 1 kW solar PV arrays and two 1.5 kW wind turbine generators, each paired with a 24 V, 150 Ah battery bank, operating on a 24 V DC bus. Results across 24 h real operational profiles demonstrate effective power balance maintenance, renewable energy maximization, and constraint-compliant battery operation (SOC is bounded within 20&amp;amp;ndash;90%). A direct comparison with a conventional centralized JavaScript-based EMS confirms equivalent dispatch accuracy while demonstrating superior scalability, fault tolerance, and modularity of the proposed JADE MAS architecture.</p>
	]]></content:encoded>

	<dc:title>Multi-Agent System-Based Real-Time Implementation of Advanced Energy Management in Hybrid Microgrids</dc:title>
			<dc:creator>Praveen Kumar Reddy Kudumula</dc:creator>
			<dc:creator>P. Balachennaiah</dc:creator>
		<dc:identifier>doi: 10.3390/info17050497</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-18</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-18</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>497</prism:startingPage>
		<prism:doi>10.3390/info17050497</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/497</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/496">

	<title>Information, Vol. 17, Pages 496: Explainable Transformer Models for Human Emotion Recognition: A Multi-Method Explainability Study in the Context of Mental Health</title>
	<link>https://www.mdpi.com/2078-2489/17/5/496</link>
	<description>The ability to identify emotions based on written text is one of the core areas of Natural Language Processing (NLP) and has many applications in areas such as mental health monitoring, sentiment analysis, and dialogue systems. This study proposes an explainable emotion recognition (EER) framework built on a fine-tuned RoBERTa-base model trained on the Emotions for NLP dataset with an accuracy of 92.4% and a weighted F1 score of 92.5%. To interpret the decision process of the EER model, we systematically applied four complementary explainable artificial intelligence (XAI) techniques to provide explanations and insights into how the model makes its predictions: SHAP for global token-level feature attribution, LIME for local instance-level explanations, multi-head attention visualization for structural interpretability, and integrated gradients via Captum for axiom-satisfying gradient-based attribution. Each of these four methods provides complementary multi-perspective views of EER model behavior, which can help increase model transparency, identify potential biases, and enable the responsible use of transformer-based models in critical environments (e.g., those requiring formal clinical documentation). Our experiments consistently show that the EER model identifies tokens as having the highest emotional expression level as the strongest predictive feature across methodological perspectives, with strong evidence of cross-methodological agreement regarding the semantic coherence of learned representations. Our findings have direct implications for the responsible implementation of AI-based emotion recognition systems in mental health support systems, where model user-interface transparency, bias mitigation, and clinical trust are necessary to ensure quality patient care.</description>
	<pubDate>2026-05-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 496: Explainable Transformer Models for Human Emotion Recognition: A Multi-Method Explainability Study in the Context of Mental Health</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/496">doi: 10.3390/info17050496</a></p>
	<p>Authors:
		Muhammad Azhar
		Naureen Riaz
		Waqar Azeem
		Deshinta Arrova Dewi
		Adeen Amjad
		Muhammad Arman
		</p>
	<p>The ability to identify emotions based on written text is one of the core areas of Natural Language Processing (NLP) and has many applications in areas such as mental health monitoring, sentiment analysis, and dialogue systems. This study proposes an explainable emotion recognition (EER) framework built on a fine-tuned RoBERTa-base model trained on the Emotions for NLP dataset with an accuracy of 92.4% and a weighted F1 score of 92.5%. To interpret the decision process of the EER model, we systematically applied four complementary explainable artificial intelligence (XAI) techniques to provide explanations and insights into how the model makes its predictions: SHAP for global token-level feature attribution, LIME for local instance-level explanations, multi-head attention visualization for structural interpretability, and integrated gradients via Captum for axiom-satisfying gradient-based attribution. Each of these four methods provides complementary multi-perspective views of EER model behavior, which can help increase model transparency, identify potential biases, and enable the responsible use of transformer-based models in critical environments (e.g., those requiring formal clinical documentation). Our experiments consistently show that the EER model identifies tokens as having the highest emotional expression level as the strongest predictive feature across methodological perspectives, with strong evidence of cross-methodological agreement regarding the semantic coherence of learned representations. Our findings have direct implications for the responsible implementation of AI-based emotion recognition systems in mental health support systems, where model user-interface transparency, bias mitigation, and clinical trust are necessary to ensure quality patient care.</p>
	]]></content:encoded>

	<dc:title>Explainable Transformer Models for Human Emotion Recognition: A Multi-Method Explainability Study in the Context of Mental Health</dc:title>
			<dc:creator>Muhammad Azhar</dc:creator>
			<dc:creator>Naureen Riaz</dc:creator>
			<dc:creator>Waqar Azeem</dc:creator>
			<dc:creator>Deshinta Arrova Dewi</dc:creator>
			<dc:creator>Adeen Amjad</dc:creator>
			<dc:creator>Muhammad Arman</dc:creator>
		<dc:identifier>doi: 10.3390/info17050496</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-18</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-18</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>496</prism:startingPage>
		<prism:doi>10.3390/info17050496</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/496</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/495">

	<title>Information, Vol. 17, Pages 495: A Study on the Generation and Evaluation of Illustrations for Chinese Idiom Allusions Based on AIGC</title>
	<link>https://www.mdpi.com/2078-2489/17/5/495</link>
	<description>As carriers of traditional culture, Chinese idiom allusions contain rich semantic and emotional content. High-quality illustrations of these idioms hold significant potential for applications in cultural communication and education. Although generative artificial intelligence has achieved substantial progress in general image synthesis, it remains challenging to produce idiom illustrations in culture-intensive scenarios that simultaneously preserve cultural symbols, maintain affective ontology, and exhibit high visual aesthetic quality. To address this gap, we propose a three-dimensional evaluation framework&amp;amp;mdash;Zhen-Shan-Mei (Truth-Goodness-Beauty)&amp;amp;mdash;for idiom illustrations. The &amp;amp;lsquo;Truth&amp;amp;rsquo; module uses Chinese vision&amp;amp;ndash;language models to quantify cultural symbols; the &amp;amp;lsquo;Goodness&amp;amp;rsquo; module applies cross-modal affective analysis to assess affective ontology; and the &amp;amp;lsquo;Beauty&amp;amp;rsquo; module computes quantitative aesthetic metrics (composition balance, color harmony, and line expressiveness). Based on this system, an AI-idiom prototype system is constructed to realize closed-loop iteration of generation-evaluation-regeneration and threshold screening. Experiments show that the proportion of illustrations selected by subjects after the &amp;amp;ldquo;Truth-Goodness-Beauty&amp;amp;rdquo; screening reaches 78.1%. The results suggest that the proposed method is effective in maintaining cultural symbols, strengthening affective ontology, and improving visual aesthetics and offers a potentially interpretable and reproducible evaluation and optimization framework for culture-intensive image generation tasks.</description>
	<pubDate>2026-05-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 495: A Study on the Generation and Evaluation of Illustrations for Chinese Idiom Allusions Based on AIGC</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/495">doi: 10.3390/info17050495</a></p>
	<p>Authors:
		Jingxue Li
		Youping Teng
		Weijia Wang
		</p>
	<p>As carriers of traditional culture, Chinese idiom allusions contain rich semantic and emotional content. High-quality illustrations of these idioms hold significant potential for applications in cultural communication and education. Although generative artificial intelligence has achieved substantial progress in general image synthesis, it remains challenging to produce idiom illustrations in culture-intensive scenarios that simultaneously preserve cultural symbols, maintain affective ontology, and exhibit high visual aesthetic quality. To address this gap, we propose a three-dimensional evaluation framework&amp;amp;mdash;Zhen-Shan-Mei (Truth-Goodness-Beauty)&amp;amp;mdash;for idiom illustrations. The &amp;amp;lsquo;Truth&amp;amp;rsquo; module uses Chinese vision&amp;amp;ndash;language models to quantify cultural symbols; the &amp;amp;lsquo;Goodness&amp;amp;rsquo; module applies cross-modal affective analysis to assess affective ontology; and the &amp;amp;lsquo;Beauty&amp;amp;rsquo; module computes quantitative aesthetic metrics (composition balance, color harmony, and line expressiveness). Based on this system, an AI-idiom prototype system is constructed to realize closed-loop iteration of generation-evaluation-regeneration and threshold screening. Experiments show that the proportion of illustrations selected by subjects after the &amp;amp;ldquo;Truth-Goodness-Beauty&amp;amp;rdquo; screening reaches 78.1%. The results suggest that the proposed method is effective in maintaining cultural symbols, strengthening affective ontology, and improving visual aesthetics and offers a potentially interpretable and reproducible evaluation and optimization framework for culture-intensive image generation tasks.</p>
	]]></content:encoded>

	<dc:title>A Study on the Generation and Evaluation of Illustrations for Chinese Idiom Allusions Based on AIGC</dc:title>
			<dc:creator>Jingxue Li</dc:creator>
			<dc:creator>Youping Teng</dc:creator>
			<dc:creator>Weijia Wang</dc:creator>
		<dc:identifier>doi: 10.3390/info17050495</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-18</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-18</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>495</prism:startingPage>
		<prism:doi>10.3390/info17050495</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/495</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/494">

	<title>Information, Vol. 17, Pages 494: The Construction Method of Jiangxi Geological Big Data Platform in China</title>
	<link>https://www.mdpi.com/2078-2489/17/5/494</link>
	<description>Aiming at the problems of low information management levels and low reuse rate of massive heterogeneous geological data of the Jiangxi Geological Bureau, a Jiangxi geological big data platform based on cloud service and big data technology was designed to realize the integration and sharing of Jiangxi geological big data. Firstly, the architecture of the Jiangxi geological big data platform is designed based on hierarchical thinking, including the infrastructure layer, data layer, platform service layer, application layer and user layer from the bottom up. Secondly, the key technologies for building a Jiangxi big data platform are described, including multi-layer service aggregation, geographic information service bus, geocoding service, Spark big data technology and elastic scaling technology. Finally, the main functions of the Jiangxi geological big data platform are introduced, including a platform portal website, a mobile portal system, a geological big data comprehensive analysis system and a geological 3D modeling system. The operation results of the platform show that the Jiangxi geological big data platform can effectively manage the massive heterogeneous geological data of the Jiangxi Geological Bureau and mine the value of the data.</description>
	<pubDate>2026-05-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 494: The Construction Method of Jiangxi Geological Big Data Platform in China</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/494">doi: 10.3390/info17050494</a></p>
	<p>Authors:
		Hui Zhu
		Bin Xiao
		Yun Li
		Xiaolong Li
		</p>
	<p>Aiming at the problems of low information management levels and low reuse rate of massive heterogeneous geological data of the Jiangxi Geological Bureau, a Jiangxi geological big data platform based on cloud service and big data technology was designed to realize the integration and sharing of Jiangxi geological big data. Firstly, the architecture of the Jiangxi geological big data platform is designed based on hierarchical thinking, including the infrastructure layer, data layer, platform service layer, application layer and user layer from the bottom up. Secondly, the key technologies for building a Jiangxi big data platform are described, including multi-layer service aggregation, geographic information service bus, geocoding service, Spark big data technology and elastic scaling technology. Finally, the main functions of the Jiangxi geological big data platform are introduced, including a platform portal website, a mobile portal system, a geological big data comprehensive analysis system and a geological 3D modeling system. The operation results of the platform show that the Jiangxi geological big data platform can effectively manage the massive heterogeneous geological data of the Jiangxi Geological Bureau and mine the value of the data.</p>
	]]></content:encoded>

	<dc:title>The Construction Method of Jiangxi Geological Big Data Platform in China</dc:title>
			<dc:creator>Hui Zhu</dc:creator>
			<dc:creator>Bin Xiao</dc:creator>
			<dc:creator>Yun Li</dc:creator>
			<dc:creator>Xiaolong Li</dc:creator>
		<dc:identifier>doi: 10.3390/info17050494</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-17</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-17</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>494</prism:startingPage>
		<prism:doi>10.3390/info17050494</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/494</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/493">

	<title>Information, Vol. 17, Pages 493: Forensic Video Recovery from Multi-Channel Analog DVR Systems: Channel Demultiplexing and Temporal Reconstruction from Interleaved DHAV Streams</title>
	<link>https://www.mdpi.com/2078-2489/17/5/493</link>
	<description>Analog digital video recorders (DVRs) are still extensively used in small-to-medium business and home security systems, but there are special problems when it comes to forensic recovery of video evidence in these systems that are not covered by tools or methodology. Compared to the IP-based network video recorders, analog DVRs packetize video frames of several coaxial-connected cameras into a single interleaved binary stream on disk, necessitating channel demultiplexing before single camera footage can be reassembled. In this paper, we discuss a multi-channel analog Dahua DVR system utilizing the DHAV frame format, with a focus on the forensic recovery approach. Three significant contributions are presented in the methodology: (1) a channel demultiplexing algorithm that separates interleaved frames with up to 32 cameras on the basis of embedded channel identifiers and temporal coherence analysis; (2) a frame sequence stitching mechanism to reassemble continuous video segments on the basis of non-contiguous disk fragments using adaptive frame number tolerance (&amp;amp;plusmn;3 frames) and temporal validation (&amp;amp;le;1 second difference); and (3) a native C implementation with Win32 GUI providing significant performance improvements over interpreted alternatives. The system was tested on 14 analog Dahua DVR hard drives of various models, with a 92.3% recovery rate (97.1% on hard drives with no hardware damage), 91.3% temporal accuracy, 97.5% channel separation accuracy and a 1.8% false positive rate. The methodology fills an important gap in the literature of surveillance forensics, where current studies have only concentrated on IP-based digital systems, and analog DVRs form an estimated 35&amp;amp;ndash;40% of operational surveillance systems across emerging markets. The channel demultiplexing capability, which is not found in any current commercial or academic tool, enables automated per-camera organization of interleaved streams, converting what was previously a manual multi-day process into an automated one.</description>
	<pubDate>2026-05-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 493: Forensic Video Recovery from Multi-Channel Analog DVR Systems: Channel Demultiplexing and Temporal Reconstruction from Interleaved DHAV Streams</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/493">doi: 10.3390/info17050493</a></p>
	<p>Authors:
		Leila Rzayeva
		Madi Shayakhmetov
		Olzhas Konakbayev
		Gul Gabdulualitovna Jussupova
		Igor Seniushin
		Anara Tasbolat
		</p>
	<p>Analog digital video recorders (DVRs) are still extensively used in small-to-medium business and home security systems, but there are special problems when it comes to forensic recovery of video evidence in these systems that are not covered by tools or methodology. Compared to the IP-based network video recorders, analog DVRs packetize video frames of several coaxial-connected cameras into a single interleaved binary stream on disk, necessitating channel demultiplexing before single camera footage can be reassembled. In this paper, we discuss a multi-channel analog Dahua DVR system utilizing the DHAV frame format, with a focus on the forensic recovery approach. Three significant contributions are presented in the methodology: (1) a channel demultiplexing algorithm that separates interleaved frames with up to 32 cameras on the basis of embedded channel identifiers and temporal coherence analysis; (2) a frame sequence stitching mechanism to reassemble continuous video segments on the basis of non-contiguous disk fragments using adaptive frame number tolerance (&amp;amp;plusmn;3 frames) and temporal validation (&amp;amp;le;1 second difference); and (3) a native C implementation with Win32 GUI providing significant performance improvements over interpreted alternatives. The system was tested on 14 analog Dahua DVR hard drives of various models, with a 92.3% recovery rate (97.1% on hard drives with no hardware damage), 91.3% temporal accuracy, 97.5% channel separation accuracy and a 1.8% false positive rate. The methodology fills an important gap in the literature of surveillance forensics, where current studies have only concentrated on IP-based digital systems, and analog DVRs form an estimated 35&amp;amp;ndash;40% of operational surveillance systems across emerging markets. The channel demultiplexing capability, which is not found in any current commercial or academic tool, enables automated per-camera organization of interleaved streams, converting what was previously a manual multi-day process into an automated one.</p>
	]]></content:encoded>

	<dc:title>Forensic Video Recovery from Multi-Channel Analog DVR Systems: Channel Demultiplexing and Temporal Reconstruction from Interleaved DHAV Streams</dc:title>
			<dc:creator>Leila Rzayeva</dc:creator>
			<dc:creator>Madi Shayakhmetov</dc:creator>
			<dc:creator>Olzhas Konakbayev</dc:creator>
			<dc:creator>Gul Gabdulualitovna Jussupova</dc:creator>
			<dc:creator>Igor Seniushin</dc:creator>
			<dc:creator>Anara Tasbolat</dc:creator>
		<dc:identifier>doi: 10.3390/info17050493</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-17</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-17</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>493</prism:startingPage>
		<prism:doi>10.3390/info17050493</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/493</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/492">

	<title>Information, Vol. 17, Pages 492: Block-Distortion-Free Reversible Data Hiding in Encryption-Then-Compression Images with Fully Flexible Access Privileges</title>
	<link>https://www.mdpi.com/2078-2489/17/5/492</link>
	<description>In this paper, we propose a block-distortion-free reversible data hiding method for encryption-then-compression (EtC) images that supports fully flexible access privileges without constraints on the restoration order. The proposed approach redesigns the pre-processing strategy of previous work to ensure a clear separation of processing roles between the image owner and the data hider. It also introduces a pixel-value modification process that divides the target range into two regions to mitigate the influence of negative&amp;amp;ndash;positive inversion during restoration. As a result, block distortion in marked images is eliminated while preserving role separation between the image owner and the data hider. The proposed method offers four key advantages: flexible access privileges, elimination of block distortion, explicit role separation, and competitive hiding capacity comparable to existing methods with flexible restoration capabilities. Experimental results demonstrate that the proposed method achieves a high marked-image quality and competitive hiding capacity while maintaining the compression performance of marked EtC images. Furthermore, security analysis confirms the robustness of the generated EtC images against a representative ciphertext-only attack.</description>
	<pubDate>2026-05-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 492: Block-Distortion-Free Reversible Data Hiding in Encryption-Then-Compression Images with Fully Flexible Access Privileges</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/492">doi: 10.3390/info17050492</a></p>
	<p>Authors:
		Yusaku Kato
		Shoko Imaizumi
		</p>
	<p>In this paper, we propose a block-distortion-free reversible data hiding method for encryption-then-compression (EtC) images that supports fully flexible access privileges without constraints on the restoration order. The proposed approach redesigns the pre-processing strategy of previous work to ensure a clear separation of processing roles between the image owner and the data hider. It also introduces a pixel-value modification process that divides the target range into two regions to mitigate the influence of negative&amp;amp;ndash;positive inversion during restoration. As a result, block distortion in marked images is eliminated while preserving role separation between the image owner and the data hider. The proposed method offers four key advantages: flexible access privileges, elimination of block distortion, explicit role separation, and competitive hiding capacity comparable to existing methods with flexible restoration capabilities. Experimental results demonstrate that the proposed method achieves a high marked-image quality and competitive hiding capacity while maintaining the compression performance of marked EtC images. Furthermore, security analysis confirms the robustness of the generated EtC images against a representative ciphertext-only attack.</p>
	]]></content:encoded>

	<dc:title>Block-Distortion-Free Reversible Data Hiding in Encryption-Then-Compression Images with Fully Flexible Access Privileges</dc:title>
			<dc:creator>Yusaku Kato</dc:creator>
			<dc:creator>Shoko Imaizumi</dc:creator>
		<dc:identifier>doi: 10.3390/info17050492</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-17</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-17</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>492</prism:startingPage>
		<prism:doi>10.3390/info17050492</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/492</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/491">

	<title>Information, Vol. 17, Pages 491: MultiTask-Fish: A Shared Backbone Multitask Counting Method for Complex Fish School Scenes</title>
	<link>https://www.mdpi.com/2078-2489/17/5/491</link>
	<description>With the growing demand for intelligent monitoring in land-based aquaculture, rapid and accurate fish counting from visual data has become important for stocking density regulation, feeding management, and production decisions. To address the challenges in above-water fish images, including scale variation, severe occlusion and adhesion, blurred boundaries, and frequent switching between low- and high-density scenes, this study proposes MultiTask-Fish, a shared backbone multitask counting method. The network uses ResNet34 as the backbone and integrates a feature pyramid network and channel attention to learn unified feature representations. It jointly predicts detection heatmaps, foreground masks, separation boundaries, density maps, density gating, and global count regression, allowing the model to combine local localization cues, structural information, and global statistics. Based on existing polygon annotations, heatmap, mask, boundary, and density supervision are automatically generated for integrated multitask training. Experiments on 495 fish images, including 346 training and 149 validation images, showed that the proposed method achieved an MAE of 5.875, an RMSE of 11.839, and an MAPE of 0.152 on the validation set, while reducing the MAE on the high-density subset from 16.717 to 13.895. These results demonstrate its effectiveness for fish counting in complex above-water aquaculture scenes.</description>
	<pubDate>2026-05-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 491: MultiTask-Fish: A Shared Backbone Multitask Counting Method for Complex Fish School Scenes</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/491">doi: 10.3390/info17050491</a></p>
	<p>Authors:
		Sikun Wang
		Jing-Wein Wang
		Cunwei Lu
		</p>
	<p>With the growing demand for intelligent monitoring in land-based aquaculture, rapid and accurate fish counting from visual data has become important for stocking density regulation, feeding management, and production decisions. To address the challenges in above-water fish images, including scale variation, severe occlusion and adhesion, blurred boundaries, and frequent switching between low- and high-density scenes, this study proposes MultiTask-Fish, a shared backbone multitask counting method. The network uses ResNet34 as the backbone and integrates a feature pyramid network and channel attention to learn unified feature representations. It jointly predicts detection heatmaps, foreground masks, separation boundaries, density maps, density gating, and global count regression, allowing the model to combine local localization cues, structural information, and global statistics. Based on existing polygon annotations, heatmap, mask, boundary, and density supervision are automatically generated for integrated multitask training. Experiments on 495 fish images, including 346 training and 149 validation images, showed that the proposed method achieved an MAE of 5.875, an RMSE of 11.839, and an MAPE of 0.152 on the validation set, while reducing the MAE on the high-density subset from 16.717 to 13.895. These results demonstrate its effectiveness for fish counting in complex above-water aquaculture scenes.</p>
	]]></content:encoded>

	<dc:title>MultiTask-Fish: A Shared Backbone Multitask Counting Method for Complex Fish School Scenes</dc:title>
			<dc:creator>Sikun Wang</dc:creator>
			<dc:creator>Jing-Wein Wang</dc:creator>
			<dc:creator>Cunwei Lu</dc:creator>
		<dc:identifier>doi: 10.3390/info17050491</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-17</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-17</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>491</prism:startingPage>
		<prism:doi>10.3390/info17050491</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/491</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/490">

	<title>Information, Vol. 17, Pages 490: Secure Clone Node Detection in Wireless Sensor Networks Using Spatial Feature Clustering and Ensemble Neural Classification</title>
	<link>https://www.mdpi.com/2078-2489/17/5/490</link>
	<description>WSNs are a core technology that enables real-time sensing and data collection in most applications; however, because of the uncontrollable nature of their open deployment environments, they are susceptible to severe security risks. The node clone attacks are the most dangerous: a malicious individual physically captures a legitimate sensor and steals its stored credentials and introduces several replica nodes into the network. These clones have legitimate identities, and hence, the clones act as legitimate members and can disrupt data streams, disrupt routing and affect general network reliability. Addressing this menace is not easy since sensor equipment has limited resources. Carefully, detection algorithms have to be energy efficient, friendly to memory, and usable in a large network. In the given paper, it is suggested to implement a detection framework that consists of a combination of Spatial Distributive Clustering (SDC) and a Block Ensemble Neural Network (BENN). SDC clusters node features based on spatial layout and behavioral patterns, which minimizes redundancy of data and enhances the quality of information that is inputted by the classifier. BENN then undergoes an ensemble-based classification to be able to differentiate cloned and legitimate nodes. Validation of the experimental results of the SDC-BENN framework with conventional classification metrics indicates that it can be used to ensure a high detection rate with minimal communication overhead, which is of high benefit in terms of enhancing the security of WSNs.</description>
	<pubDate>2026-05-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 490: Secure Clone Node Detection in Wireless Sensor Networks Using Spatial Feature Clustering and Ensemble Neural Classification</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/490">doi: 10.3390/info17050490</a></p>
	<p>Authors:
		Swetha Pandithahalli Mahadevaswamy
		Prasanna Bantaganahalli Thimmappa
		</p>
	<p>WSNs are a core technology that enables real-time sensing and data collection in most applications; however, because of the uncontrollable nature of their open deployment environments, they are susceptible to severe security risks. The node clone attacks are the most dangerous: a malicious individual physically captures a legitimate sensor and steals its stored credentials and introduces several replica nodes into the network. These clones have legitimate identities, and hence, the clones act as legitimate members and can disrupt data streams, disrupt routing and affect general network reliability. Addressing this menace is not easy since sensor equipment has limited resources. Carefully, detection algorithms have to be energy efficient, friendly to memory, and usable in a large network. In the given paper, it is suggested to implement a detection framework that consists of a combination of Spatial Distributive Clustering (SDC) and a Block Ensemble Neural Network (BENN). SDC clusters node features based on spatial layout and behavioral patterns, which minimizes redundancy of data and enhances the quality of information that is inputted by the classifier. BENN then undergoes an ensemble-based classification to be able to differentiate cloned and legitimate nodes. Validation of the experimental results of the SDC-BENN framework with conventional classification metrics indicates that it can be used to ensure a high detection rate with minimal communication overhead, which is of high benefit in terms of enhancing the security of WSNs.</p>
	]]></content:encoded>

	<dc:title>Secure Clone Node Detection in Wireless Sensor Networks Using Spatial Feature Clustering and Ensemble Neural Classification</dc:title>
			<dc:creator>Swetha Pandithahalli Mahadevaswamy</dc:creator>
			<dc:creator>Prasanna Bantaganahalli Thimmappa</dc:creator>
		<dc:identifier>doi: 10.3390/info17050490</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>490</prism:startingPage>
		<prism:doi>10.3390/info17050490</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/490</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/489">

	<title>Information, Vol. 17, Pages 489: Multiset Lempel&amp;ndash;Ziv Jaccard Distance</title>
	<link>https://www.mdpi.com/2078-2489/17/5/489</link>
	<description>The performance of pattern classification is affected significantly by feature selection. However, for security applications, selecting proper features is difficult, as malicious software continuously changes its characteristics. Thus, compression-based pattern recognition has attracted much attention because it does not require explicit feature selection to design proper distance measures. LZJD (Lempel&amp;amp;ndash;Ziv Jaccard Distance), in particular, has been useful for malware classification, as it computes compression distances without actually compressing objects and is suitable for handling large files like malware. LZJD extracts a compression dictionary for every object in advance and estimates a similarity between two objects by comparing their compression dictionaries. However, LZJD ignores the similarity between words in a compression dictionary. As a result, even if the dictionary has many similar words, they are simply processed as different words. To exploit the similarity between words, we propose to remove the last characters of words in the dictionary and to unify similar words that share the same prefix. This unification of words turns the compression dictionary into a multiset of words. Hence, our compression distance is named MLZJD (Multiset LZJD). In addition, the unification of words in MLZJD decreases the number of word kinds in compression dictionaries and contributes to speeding up the distance computation. We experimentally show that MLZJD halves the execution time as compared with LZJD, while hardly damaging the classification accuracy. Even on condition that the compression distances are approximated with Min-Hash, MLZJD achieves a much shorter running time than LZJD, while retaining almost the same classification accuracy as LZJD.</description>
	<pubDate>2026-05-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 489: Multiset Lempel&amp;ndash;Ziv Jaccard Distance</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/489">doi: 10.3390/info17050489</a></p>
	<p>Authors:
		Satoshi Aoki
		Hisashi Koga
		</p>
	<p>The performance of pattern classification is affected significantly by feature selection. However, for security applications, selecting proper features is difficult, as malicious software continuously changes its characteristics. Thus, compression-based pattern recognition has attracted much attention because it does not require explicit feature selection to design proper distance measures. LZJD (Lempel&amp;amp;ndash;Ziv Jaccard Distance), in particular, has been useful for malware classification, as it computes compression distances without actually compressing objects and is suitable for handling large files like malware. LZJD extracts a compression dictionary for every object in advance and estimates a similarity between two objects by comparing their compression dictionaries. However, LZJD ignores the similarity between words in a compression dictionary. As a result, even if the dictionary has many similar words, they are simply processed as different words. To exploit the similarity between words, we propose to remove the last characters of words in the dictionary and to unify similar words that share the same prefix. This unification of words turns the compression dictionary into a multiset of words. Hence, our compression distance is named MLZJD (Multiset LZJD). In addition, the unification of words in MLZJD decreases the number of word kinds in compression dictionaries and contributes to speeding up the distance computation. We experimentally show that MLZJD halves the execution time as compared with LZJD, while hardly damaging the classification accuracy. Even on condition that the compression distances are approximated with Min-Hash, MLZJD achieves a much shorter running time than LZJD, while retaining almost the same classification accuracy as LZJD.</p>
	]]></content:encoded>

	<dc:title>Multiset Lempel&amp;amp;ndash;Ziv Jaccard Distance</dc:title>
			<dc:creator>Satoshi Aoki</dc:creator>
			<dc:creator>Hisashi Koga</dc:creator>
		<dc:identifier>doi: 10.3390/info17050489</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>489</prism:startingPage>
		<prism:doi>10.3390/info17050489</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/489</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/488">

	<title>Information, Vol. 17, Pages 488: MongoDB Aggregation Pipeline Performance: Analysis of Query Plan Selection and Optimizer Behavior Across Versions and Collection Scales</title>
	<link>https://www.mdpi.com/2078-2489/17/5/488</link>
	<description>This article examines how MongoDB optimizes aggregation pipeline queries, focusing on two mechanisms: a trial-based plan selection process that runs candidate execution plans in parallel and picks the one returning the most results for the least work, and rule-based operator rewriting by the Pipeline Optimizer. The study tests nine aggregation query types on a synthetic e-commerce dataset with 50K documents, using MongoDB versions 6.0.3 and 8.2.5 under identical conditions. For each query, all valid operator orderings are evaluated together with the physical execution plan and the Pipeline Optimizer output. Each test runs 20 times with the plan cache cleared before every run. The study also tests scalability with datasets of 150K and 250K documents. Three cases are identified where the rule-based optimizer falls short: IXSCAN preference bias at low selectivity, where the suboptimal plan is up to nine times slower than the optimal (80 ms vs. 699 ms at 250K under MongoDB 8.2.5), unbounded document multiplication after $unwind, and failure to account for $group output cardinality. MongoDB 8.2.5 improves performance in most cases compared to version 6.0.3. $match + $group queries run up to 28% faster. Queries that rely on IXSCAN improve by up to 18%. Unbounded projection operations run slower in MongoDB 8.2.5 at all tested sizes. The slowdown is +23% at 50K, +3% at 150K, and +14% at 250K, pointing to a change in the projection execution path between versions.</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 488: MongoDB Aggregation Pipeline Performance: Analysis of Query Plan Selection and Optimizer Behavior Across Versions and Collection Scales</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/488">doi: 10.3390/info17050488</a></p>
	<p>Authors:
		Rosen Ivanov
		</p>
	<p>This article examines how MongoDB optimizes aggregation pipeline queries, focusing on two mechanisms: a trial-based plan selection process that runs candidate execution plans in parallel and picks the one returning the most results for the least work, and rule-based operator rewriting by the Pipeline Optimizer. The study tests nine aggregation query types on a synthetic e-commerce dataset with 50K documents, using MongoDB versions 6.0.3 and 8.2.5 under identical conditions. For each query, all valid operator orderings are evaluated together with the physical execution plan and the Pipeline Optimizer output. Each test runs 20 times with the plan cache cleared before every run. The study also tests scalability with datasets of 150K and 250K documents. Three cases are identified where the rule-based optimizer falls short: IXSCAN preference bias at low selectivity, where the suboptimal plan is up to nine times slower than the optimal (80 ms vs. 699 ms at 250K under MongoDB 8.2.5), unbounded document multiplication after $unwind, and failure to account for $group output cardinality. MongoDB 8.2.5 improves performance in most cases compared to version 6.0.3. $match + $group queries run up to 28% faster. Queries that rely on IXSCAN improve by up to 18%. Unbounded projection operations run slower in MongoDB 8.2.5 at all tested sizes. The slowdown is +23% at 50K, +3% at 150K, and +14% at 250K, pointing to a change in the projection execution path between versions.</p>
	]]></content:encoded>

	<dc:title>MongoDB Aggregation Pipeline Performance: Analysis of Query Plan Selection and Optimizer Behavior Across Versions and Collection Scales</dc:title>
			<dc:creator>Rosen Ivanov</dc:creator>
		<dc:identifier>doi: 10.3390/info17050488</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>488</prism:startingPage>
		<prism:doi>10.3390/info17050488</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/488</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/487">

	<title>Information, Vol. 17, Pages 487: CALM: Curriculum Anatomy-Guided Learning Method with Population Template Priors for Source-Free Cross-Modality Prostate MRI Segmentation</title>
	<link>https://www.mdpi.com/2078-2489/17/5/487</link>
	<description>Source-free domain adaptation (SFDA) for cross-modality prostate MRI segmentation is challenging because source data are unavailable and pseudo-labels on target ADC images are often noisy. To address this problem, we propose Curriculum Anatomy-guided Learning Method with Population Template Priors (CALM), a source-free adaptation framework for this task. CALM constructs a population template prior from target predictions using top-k consensus aggregation and cross-round exponential moving average, then combines this prior with instance-level predictions through Soft-AND fusion. A high-confidence background constraint is further introduced to provide reliable negative supervision, and a coverage-driven curriculum is used to expand training from easy to hard cases based on pseudo-label/template agreement. This design forms an iterative process in which prior refinement and sample-reliability refinement reinforce each other during adaptation. Experiments on the PI-CAI dataset under the T2W-to-ADC setting show that CALM achieves an average Dice score of 73.63% and outperforms representative SFDA baselines in both segmentation accuracy and boundary quality. Ablation and model analyses support the contribution of each component. These results suggest that population-level anatomical priors can provide practical structural guidance for source-free cross-modality adaptation.</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 487: CALM: Curriculum Anatomy-Guided Learning Method with Population Template Priors for Source-Free Cross-Modality Prostate MRI Segmentation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/487">doi: 10.3390/info17050487</a></p>
	<p>Authors:
		Xiyu Zhang
		Xu Chen
		Yang Wang
		Yifeng Hong
		Yuntian Bai
		</p>
	<p>Source-free domain adaptation (SFDA) for cross-modality prostate MRI segmentation is challenging because source data are unavailable and pseudo-labels on target ADC images are often noisy. To address this problem, we propose Curriculum Anatomy-guided Learning Method with Population Template Priors (CALM), a source-free adaptation framework for this task. CALM constructs a population template prior from target predictions using top-k consensus aggregation and cross-round exponential moving average, then combines this prior with instance-level predictions through Soft-AND fusion. A high-confidence background constraint is further introduced to provide reliable negative supervision, and a coverage-driven curriculum is used to expand training from easy to hard cases based on pseudo-label/template agreement. This design forms an iterative process in which prior refinement and sample-reliability refinement reinforce each other during adaptation. Experiments on the PI-CAI dataset under the T2W-to-ADC setting show that CALM achieves an average Dice score of 73.63% and outperforms representative SFDA baselines in both segmentation accuracy and boundary quality. Ablation and model analyses support the contribution of each component. These results suggest that population-level anatomical priors can provide practical structural guidance for source-free cross-modality adaptation.</p>
	]]></content:encoded>

	<dc:title>CALM: Curriculum Anatomy-Guided Learning Method with Population Template Priors for Source-Free Cross-Modality Prostate MRI Segmentation</dc:title>
			<dc:creator>Xiyu Zhang</dc:creator>
			<dc:creator>Xu Chen</dc:creator>
			<dc:creator>Yang Wang</dc:creator>
			<dc:creator>Yifeng Hong</dc:creator>
			<dc:creator>Yuntian Bai</dc:creator>
		<dc:identifier>doi: 10.3390/info17050487</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>487</prism:startingPage>
		<prism:doi>10.3390/info17050487</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/487</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/485">

	<title>Information, Vol. 17, Pages 485: Antagonistic Differential Game of Critical Infrastructure Migration Management to Post-Quantum Cryptography Under HNDL Conditions</title>
	<link>https://www.mdpi.com/2078-2489/17/5/485</link>
	<description>Advances in quantum computing have created a serious threat to modern asymmetric cryptosystems protecting heterogeneous critical information infrastructures (CIIs). During this transition period, the primary threat is the &amp;amp;ldquo;Harvest Now, Decrypt Later&amp;amp;rdquo; (HNDL) temporal strategy of attackers, which requires the forced migration of CIIs to post-quantum cryptography (PQC) algorithms. However, such migration is associated with nonlinear &amp;amp;ldquo;technological friction.&amp;amp;rdquo; This will manifest as a drop in the performance of legacy systems, such as SCADA. In the context of deep cross-industry integration, this can trigger avalanche-like cascading CII failures. This article presents a model of a zero-sum differential game between a CII defender and an attacker (APT group). Using Pontryagin&amp;amp;rsquo;s maximum principle and the Forward&amp;amp;ndash;Backward Sweep Method (FBSM) iterative algorithm, a saddle point was found that determines the equilibrium trajectories of limited resource allocation over a given planning horizon for the CII transition to PQC. The results of the computational experiment demonstrated that isolated sectoral migration is ineffective. It is shown that optimal control requires cross-sector synchronization to prevent cascading degradation of the CII. The proposed mathematical framework provides a practical toolkit for strategic IT budget planning and national security risk management in anticipation of quantum supremacy (Q-Day).</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 485: Antagonistic Differential Game of Critical Infrastructure Migration Management to Post-Quantum Cryptography Under HNDL Conditions</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/485">doi: 10.3390/info17050485</a></p>
	<p>Authors:
		Feruza Malikova
		Valery Lakhno
		Zhuldyz Alimseitova
		Myroslav Lakhno
		Kuljan Togzhanova
		Gulzhanat Beketova
		</p>
	<p>Advances in quantum computing have created a serious threat to modern asymmetric cryptosystems protecting heterogeneous critical information infrastructures (CIIs). During this transition period, the primary threat is the &amp;amp;ldquo;Harvest Now, Decrypt Later&amp;amp;rdquo; (HNDL) temporal strategy of attackers, which requires the forced migration of CIIs to post-quantum cryptography (PQC) algorithms. However, such migration is associated with nonlinear &amp;amp;ldquo;technological friction.&amp;amp;rdquo; This will manifest as a drop in the performance of legacy systems, such as SCADA. In the context of deep cross-industry integration, this can trigger avalanche-like cascading CII failures. This article presents a model of a zero-sum differential game between a CII defender and an attacker (APT group). Using Pontryagin&amp;amp;rsquo;s maximum principle and the Forward&amp;amp;ndash;Backward Sweep Method (FBSM) iterative algorithm, a saddle point was found that determines the equilibrium trajectories of limited resource allocation over a given planning horizon for the CII transition to PQC. The results of the computational experiment demonstrated that isolated sectoral migration is ineffective. It is shown that optimal control requires cross-sector synchronization to prevent cascading degradation of the CII. The proposed mathematical framework provides a practical toolkit for strategic IT budget planning and national security risk management in anticipation of quantum supremacy (Q-Day).</p>
	]]></content:encoded>

	<dc:title>Antagonistic Differential Game of Critical Infrastructure Migration Management to Post-Quantum Cryptography Under HNDL Conditions</dc:title>
			<dc:creator>Feruza Malikova</dc:creator>
			<dc:creator>Valery Lakhno</dc:creator>
			<dc:creator>Zhuldyz Alimseitova</dc:creator>
			<dc:creator>Myroslav Lakhno</dc:creator>
			<dc:creator>Kuljan Togzhanova</dc:creator>
			<dc:creator>Gulzhanat Beketova</dc:creator>
		<dc:identifier>doi: 10.3390/info17050485</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>485</prism:startingPage>
		<prism:doi>10.3390/info17050485</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/485</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/486">

	<title>Information, Vol. 17, Pages 486: A Network Intrusion Detection System Based on VAE-CWGAN and Feature Selection</title>
	<link>https://www.mdpi.com/2078-2489/17/5/486</link>
	<description>In network intrusion detection, class imbalance, the scarcity of minority-class attack samples, high feature dimensionality, and substantial feature redundancy are prevalent issues that limit the detection capability of intrusion detection models. To address these issues, this paper proposes a network traffic anomaly detection method based on a Variational Autoencoder and a Conditional Wasserstein Generative Adversarial Network (VAE-CWGAN). First, a feature selection strategy that combines ANOVA and mutual information is employed to select informative network traffic features, thereby improving the discriminative capability of the input features. Second, a minority-class sample generation model that integrates VAE and CWGAN is constructed. The VAE is used to learn the latent distribution characteristics of minority-class attack samples, while class-conditional constraints and the Wasserstein distance are introduced to generate high-quality synthetic minority-class samples, thereby alleviating class imbalance in the training dataset. Finally, Random Forest (RF), a representative machine learning classifier, is adopted for the classification experiments. Experimental results on the NSL-KDD dataset demonstrate that the proposed method performs well in minority-class attack detection, achieving Precision, Recall, and F1-score values of 95.89%, 75.18%, and 84.28% for the R2L class and 77.08%, 55.22%, and 64.35% for the U2R class, respectively.</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 486: A Network Intrusion Detection System Based on VAE-CWGAN and Feature Selection</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/486">doi: 10.3390/info17050486</a></p>
	<p>Authors:
		Shiwen Li
		Ruifeng Shi
		</p>
	<p>In network intrusion detection, class imbalance, the scarcity of minority-class attack samples, high feature dimensionality, and substantial feature redundancy are prevalent issues that limit the detection capability of intrusion detection models. To address these issues, this paper proposes a network traffic anomaly detection method based on a Variational Autoencoder and a Conditional Wasserstein Generative Adversarial Network (VAE-CWGAN). First, a feature selection strategy that combines ANOVA and mutual information is employed to select informative network traffic features, thereby improving the discriminative capability of the input features. Second, a minority-class sample generation model that integrates VAE and CWGAN is constructed. The VAE is used to learn the latent distribution characteristics of minority-class attack samples, while class-conditional constraints and the Wasserstein distance are introduced to generate high-quality synthetic minority-class samples, thereby alleviating class imbalance in the training dataset. Finally, Random Forest (RF), a representative machine learning classifier, is adopted for the classification experiments. Experimental results on the NSL-KDD dataset demonstrate that the proposed method performs well in minority-class attack detection, achieving Precision, Recall, and F1-score values of 95.89%, 75.18%, and 84.28% for the R2L class and 77.08%, 55.22%, and 64.35% for the U2R class, respectively.</p>
	]]></content:encoded>

	<dc:title>A Network Intrusion Detection System Based on VAE-CWGAN and Feature Selection</dc:title>
			<dc:creator>Shiwen Li</dc:creator>
			<dc:creator>Ruifeng Shi</dc:creator>
		<dc:identifier>doi: 10.3390/info17050486</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>486</prism:startingPage>
		<prism:doi>10.3390/info17050486</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/486</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/484">

	<title>Information, Vol. 17, Pages 484: Facial Expression Recognition in Anime and Manga Characters: A Comparative Study of Vision Transformers and Convolutional Neural Networks</title>
	<link>https://www.mdpi.com/2078-2489/17/5/484</link>
	<description>Facial expression recognition (FER) is a well-established task in computer vision, yet its application to non-photorealistic domains, such as anime and manga, remains largely underexplored. The stylized, exaggerated, and often non-proportional facial features of illustrated characters present unique challenges for deep learning models trained predominantly on realistic imagery. In this work, we construct a balanced dataset of 3000 manga and anime face images spanning six emotion categories (Angry, Embarrassed, Happy, Manic&amp;amp;ndash;Euphoric, Sad, Scared) and conduct a systematic comparison of two major deep learning paradigms: Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs). Specifically, we evaluate ResNet-18, ResNet-50, ViT-B/16, and ViT-S/16 under four fine-tuning strategies: linear probing, partial fine-tuning, full fine-tuning, and progressive unfreezing, enabling a controlled comparison of both architectural families and transfer learning depth. Our results show that fine-tuning strategy significantly impacts performance: the best configuration (ViT-B/16 with progressive unfreezing) achieves 81.33% test accuracy (single run, seed 42), compared to 61.33% for the weakest linear probe baseline (ViT-S/16), a gap of 20.00 percentage points. To isolate architectural differences from strategy effects, we note that under full fine-tuning, the only strategy applied identically to all four models, ViT-S/16 (76.00%) outperforms ResNet-18 (74.44%) by 1.56 percentage points and ViT-B/16 (74.22%) by 1.78 percentage points, confirming a modest but consistent architectural advantage for Transformers once backbone adaptation is permitted. Vision Transformers benefit disproportionately from fine-tuning, and the relative ranking of architectures changes across fine-tuning regimes. Confusion matrix analysis reveals persistent cross-class confusion between visually similar emotions (e.g., Happy vs. Embarrassed), while the highly distinctive Manic&amp;amp;ndash;Euphoric category is consistently well recognized across all architectures. To the best of our knowledge, this is the first work to conduct a controlled multi-architecture, multi-strategy transfer learning benchmark specifically for FER in anime and manga, revealing findings that are not predictable from photographic FER literature and that carry direct practical implications for model selection in non-photorealistic visual recognition tasks. The anime and manga domain provides a uniquely controlled testbed for studying transfer learning under deliberate stylization, where the domain gap from realistic imagery is not an artifact of image degradation or environmental noise but a principled artistic choice with codified visual conventions; observing that fine-tuning depth dominates architectural choice in this domain suggests the same conclusion likely holds in other non-photorealistic transfer scenarios such as medical illustrations, architectural drawings, and synthetic training data.</description>
	<pubDate>2026-05-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 484: Facial Expression Recognition in Anime and Manga Characters: A Comparative Study of Vision Transformers and Convolutional Neural Networks</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/484">doi: 10.3390/info17050484</a></p>
	<p>Authors:
		Marco Parrillo
		Elia Santoro
		Luigi Laura
		Valerio Rughetti
		</p>
	<p>Facial expression recognition (FER) is a well-established task in computer vision, yet its application to non-photorealistic domains, such as anime and manga, remains largely underexplored. The stylized, exaggerated, and often non-proportional facial features of illustrated characters present unique challenges for deep learning models trained predominantly on realistic imagery. In this work, we construct a balanced dataset of 3000 manga and anime face images spanning six emotion categories (Angry, Embarrassed, Happy, Manic&amp;amp;ndash;Euphoric, Sad, Scared) and conduct a systematic comparison of two major deep learning paradigms: Convolutional Neural Networks (CNNs) and Vision Transformers (ViTs). Specifically, we evaluate ResNet-18, ResNet-50, ViT-B/16, and ViT-S/16 under four fine-tuning strategies: linear probing, partial fine-tuning, full fine-tuning, and progressive unfreezing, enabling a controlled comparison of both architectural families and transfer learning depth. Our results show that fine-tuning strategy significantly impacts performance: the best configuration (ViT-B/16 with progressive unfreezing) achieves 81.33% test accuracy (single run, seed 42), compared to 61.33% for the weakest linear probe baseline (ViT-S/16), a gap of 20.00 percentage points. To isolate architectural differences from strategy effects, we note that under full fine-tuning, the only strategy applied identically to all four models, ViT-S/16 (76.00%) outperforms ResNet-18 (74.44%) by 1.56 percentage points and ViT-B/16 (74.22%) by 1.78 percentage points, confirming a modest but consistent architectural advantage for Transformers once backbone adaptation is permitted. Vision Transformers benefit disproportionately from fine-tuning, and the relative ranking of architectures changes across fine-tuning regimes. Confusion matrix analysis reveals persistent cross-class confusion between visually similar emotions (e.g., Happy vs. Embarrassed), while the highly distinctive Manic&amp;amp;ndash;Euphoric category is consistently well recognized across all architectures. To the best of our knowledge, this is the first work to conduct a controlled multi-architecture, multi-strategy transfer learning benchmark specifically for FER in anime and manga, revealing findings that are not predictable from photographic FER literature and that carry direct practical implications for model selection in non-photorealistic visual recognition tasks. The anime and manga domain provides a uniquely controlled testbed for studying transfer learning under deliberate stylization, where the domain gap from realistic imagery is not an artifact of image degradation or environmental noise but a principled artistic choice with codified visual conventions; observing that fine-tuning depth dominates architectural choice in this domain suggests the same conclusion likely holds in other non-photorealistic transfer scenarios such as medical illustrations, architectural drawings, and synthetic training data.</p>
	]]></content:encoded>

	<dc:title>Facial Expression Recognition in Anime and Manga Characters: A Comparative Study of Vision Transformers and Convolutional Neural Networks</dc:title>
			<dc:creator>Marco Parrillo</dc:creator>
			<dc:creator>Elia Santoro</dc:creator>
			<dc:creator>Luigi Laura</dc:creator>
			<dc:creator>Valerio Rughetti</dc:creator>
		<dc:identifier>doi: 10.3390/info17050484</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>484</prism:startingPage>
		<prism:doi>10.3390/info17050484</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/484</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/483">

	<title>Information, Vol. 17, Pages 483: A Design-Oriented Process Mining Framework for Railway Operations</title>
	<link>https://www.mdpi.com/2078-2489/17/5/483</link>
	<description>Railway information systems routinely register the displacement of trains across the network as sequences of station passages and segment traversals. This paper proposes a design-oriented framework that systematically transforms such train displacements into event logs to enable established process mining analyses. Here, design-oriented means that the event log is not assumed to be readily available, but is explicitly constructed from railway records through modelling choices grounded in operational semantics. The framework comprises: (i) an eventization pipeline that maps displacements to semantically precise events with explicit lifecycle and case notions; (ii) construction of a timetable-derived reference model representing planned control flow; and (iii) a structural comparison and variant analysis stage that identifies execution-level deviations from the timetable-derived reference and organizes them into recurrent behavioural patterns. The paper contributes design principles for mapping train displacements into process-mining events, a timetable-derived representation of expected control flow, and an empirical demonstration on real-world railway data showing how this framework supports operational process analysis.</description>
	<pubDate>2026-05-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 483: A Design-Oriented Process Mining Framework for Railway Operations</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/483">doi: 10.3390/info17050483</a></p>
	<p>Authors:
		Iuliana Malina Grigore
		Azin Moradbeikie
		Allegra Francesca Rosso
		Alan Del Piccolo
		Dario Campagna
		Sylvio Barbon Junior
		</p>
	<p>Railway information systems routinely register the displacement of trains across the network as sequences of station passages and segment traversals. This paper proposes a design-oriented framework that systematically transforms such train displacements into event logs to enable established process mining analyses. Here, design-oriented means that the event log is not assumed to be readily available, but is explicitly constructed from railway records through modelling choices grounded in operational semantics. The framework comprises: (i) an eventization pipeline that maps displacements to semantically precise events with explicit lifecycle and case notions; (ii) construction of a timetable-derived reference model representing planned control flow; and (iii) a structural comparison and variant analysis stage that identifies execution-level deviations from the timetable-derived reference and organizes them into recurrent behavioural patterns. The paper contributes design principles for mapping train displacements into process-mining events, a timetable-derived representation of expected control flow, and an empirical demonstration on real-world railway data showing how this framework supports operational process analysis.</p>
	]]></content:encoded>

	<dc:title>A Design-Oriented Process Mining Framework for Railway Operations</dc:title>
			<dc:creator>Iuliana Malina Grigore</dc:creator>
			<dc:creator>Azin Moradbeikie</dc:creator>
			<dc:creator>Allegra Francesca Rosso</dc:creator>
			<dc:creator>Alan Del Piccolo</dc:creator>
			<dc:creator>Dario Campagna</dc:creator>
			<dc:creator>Sylvio Barbon Junior</dc:creator>
		<dc:identifier>doi: 10.3390/info17050483</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>483</prism:startingPage>
		<prism:doi>10.3390/info17050483</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/483</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/482">

	<title>Information, Vol. 17, Pages 482: Unilateral Limb Motion Imagery Decoding Algorithm Based on Adaptive Band Boundary Localization</title>
	<link>https://www.mdpi.com/2078-2489/17/5/482</link>
	<description>The unilateral limb motor imagery paradigm can effectively address the cognitive dissociation problem among multiple limbs and provide strong technical support for extending the functionality of external devices. However, feature mining and accurate decoding of unilateral limb movements remain challenging. In this study, we propose a feature mining method that combines automatic frequency band boundary localization with regularized common spatial pattern (AFBBL-RCSP), and employ a pinball-loss-based twin support vector machine (Pin-UTSVM) to decode EEG signals corresponding to reaching, turning, and grasping movements. First, multiple optimal frequency band boundaries were identified for each subject using AFBBL. Then, regularized spatial features were extracted from each sub-band, and all features were reduced using Fisher&amp;amp;rsquo;s discriminant analysis. Finally, the Pin-UTSVM classifier was used to categorize the three types of movement data. The results show that, compared with CSP and RCSP feature mining methods using the fixed 8&amp;amp;ndash;30 Hz band, the proposed method improves decoding accuracy by 9.52% and 3.89%, respectively. Compared with fixed single-band feature mining methods based on the &amp;amp;alpha; band, &amp;amp;beta; band, and &amp;amp;alpha; + &amp;amp;beta; band, the proposed method improves accuracy by 5.56%, 3.89%, and 3.73%, respectively. In addition, compared with existing unilateral limb decoding methods based on temporal-spatial features, temporal-frequency features, and temporal-spatial-temporal-frequency fusion CNN features, the proposed method improves decoding accuracy by 34.93%, 34.09%, and 28.11%, respectively. These results suggest that the proposed AFBBL-RCSP method is effective for unilateral limb motor imagery EEG decoding.</description>
	<pubDate>2026-05-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 482: Unilateral Limb Motion Imagery Decoding Algorithm Based on Adaptive Band Boundary Localization</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/482">doi: 10.3390/info17050482</a></p>
	<p>Authors:
		Yinghui Meng
		Jiaoshuai Song
		Wen Feng
		Duan Li
		Jiaofen Nan
		Fubao Zhu
		Changxiang Yuan
		</p>
	<p>The unilateral limb motor imagery paradigm can effectively address the cognitive dissociation problem among multiple limbs and provide strong technical support for extending the functionality of external devices. However, feature mining and accurate decoding of unilateral limb movements remain challenging. In this study, we propose a feature mining method that combines automatic frequency band boundary localization with regularized common spatial pattern (AFBBL-RCSP), and employ a pinball-loss-based twin support vector machine (Pin-UTSVM) to decode EEG signals corresponding to reaching, turning, and grasping movements. First, multiple optimal frequency band boundaries were identified for each subject using AFBBL. Then, regularized spatial features were extracted from each sub-band, and all features were reduced using Fisher&amp;amp;rsquo;s discriminant analysis. Finally, the Pin-UTSVM classifier was used to categorize the three types of movement data. The results show that, compared with CSP and RCSP feature mining methods using the fixed 8&amp;amp;ndash;30 Hz band, the proposed method improves decoding accuracy by 9.52% and 3.89%, respectively. Compared with fixed single-band feature mining methods based on the &amp;amp;alpha; band, &amp;amp;beta; band, and &amp;amp;alpha; + &amp;amp;beta; band, the proposed method improves accuracy by 5.56%, 3.89%, and 3.73%, respectively. In addition, compared with existing unilateral limb decoding methods based on temporal-spatial features, temporal-frequency features, and temporal-spatial-temporal-frequency fusion CNN features, the proposed method improves decoding accuracy by 34.93%, 34.09%, and 28.11%, respectively. These results suggest that the proposed AFBBL-RCSP method is effective for unilateral limb motor imagery EEG decoding.</p>
	]]></content:encoded>

	<dc:title>Unilateral Limb Motion Imagery Decoding Algorithm Based on Adaptive Band Boundary Localization</dc:title>
			<dc:creator>Yinghui Meng</dc:creator>
			<dc:creator>Jiaoshuai Song</dc:creator>
			<dc:creator>Wen Feng</dc:creator>
			<dc:creator>Duan Li</dc:creator>
			<dc:creator>Jiaofen Nan</dc:creator>
			<dc:creator>Fubao Zhu</dc:creator>
			<dc:creator>Changxiang Yuan</dc:creator>
		<dc:identifier>doi: 10.3390/info17050482</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>482</prism:startingPage>
		<prism:doi>10.3390/info17050482</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/482</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/481">

	<title>Information, Vol. 17, Pages 481: Detecting Health Product Misinformation on Social Media Using Large Language Models Grounded in Biomedical Evidence</title>
	<link>https://www.mdpi.com/2078-2489/17/5/481</link>
	<description>The spread of unverified health claims about drugs, dietary supplements, and alternative remedies on social media poses a growing public health concern. In this study, we present a retrieval-augmented generation (RAG) pipeline that uses large language models (LLMs) grounded in biomedical evidence from PubMed, openFDA adverse event reports, and NIH/NCCIH dietary supplement fact sheets to detect and classify health product misinformation. A total of 3493 health-related posts were collected from Reddit (948 posts across 12 subreddits) and YouTube (2545 video descriptions and comments), from which 8250 structured claims were extracted using Claude Haiku. Each claim was matched to biomedical evidence from three authoritative sources, achieving 79.4% evidence coverage, and classified into one of five veracity categories: supported (7.0%), unsupported (59.9%), exaggerated (22.4%), contradicted (2.0%), or dangerous (8.6%), together with an associated risk tier. Overall, 13.5% of claims were assigned high or critical risk. Cross-platform analysis showed that YouTube contained higher proportions of dangerous (11.3% vs. 2.9%) and exaggerated (27.0% vs. 12.4%) claims than Reddit. Compared with keyword-based and zero-shot transformer baselines, the LLM+RAG pipeline produced a more balanced and fine-grained classification of unsupported, exaggerated, contradicted, and dangerous claims. The most frequently implicated products were ashwagandha, kratom, black seed oil, turmeric, and ivermectin, with disease cure claims showing the highest dangerous classification rate (30.1%). These model-assigned results suggest that evidence-grounded LLM pipelines can support health misinformation surveillance, while also highlighting the need for expert validation and broader cross-platform evaluation.</description>
	<pubDate>2026-05-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 481: Detecting Health Product Misinformation on Social Media Using Large Language Models Grounded in Biomedical Evidence</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/481">doi: 10.3390/info17050481</a></p>
	<p>Authors:
		Sara Behnamian
		Zeinab Shahbazi
		Zahra Shahbazi
		Sadiqa Jafari
		</p>
	<p>The spread of unverified health claims about drugs, dietary supplements, and alternative remedies on social media poses a growing public health concern. In this study, we present a retrieval-augmented generation (RAG) pipeline that uses large language models (LLMs) grounded in biomedical evidence from PubMed, openFDA adverse event reports, and NIH/NCCIH dietary supplement fact sheets to detect and classify health product misinformation. A total of 3493 health-related posts were collected from Reddit (948 posts across 12 subreddits) and YouTube (2545 video descriptions and comments), from which 8250 structured claims were extracted using Claude Haiku. Each claim was matched to biomedical evidence from three authoritative sources, achieving 79.4% evidence coverage, and classified into one of five veracity categories: supported (7.0%), unsupported (59.9%), exaggerated (22.4%), contradicted (2.0%), or dangerous (8.6%), together with an associated risk tier. Overall, 13.5% of claims were assigned high or critical risk. Cross-platform analysis showed that YouTube contained higher proportions of dangerous (11.3% vs. 2.9%) and exaggerated (27.0% vs. 12.4%) claims than Reddit. Compared with keyword-based and zero-shot transformer baselines, the LLM+RAG pipeline produced a more balanced and fine-grained classification of unsupported, exaggerated, contradicted, and dangerous claims. The most frequently implicated products were ashwagandha, kratom, black seed oil, turmeric, and ivermectin, with disease cure claims showing the highest dangerous classification rate (30.1%). These model-assigned results suggest that evidence-grounded LLM pipelines can support health misinformation surveillance, while also highlighting the need for expert validation and broader cross-platform evaluation.</p>
	]]></content:encoded>

	<dc:title>Detecting Health Product Misinformation on Social Media Using Large Language Models Grounded in Biomedical Evidence</dc:title>
			<dc:creator>Sara Behnamian</dc:creator>
			<dc:creator>Zeinab Shahbazi</dc:creator>
			<dc:creator>Zahra Shahbazi</dc:creator>
			<dc:creator>Sadiqa Jafari</dc:creator>
		<dc:identifier>doi: 10.3390/info17050481</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>481</prism:startingPage>
		<prism:doi>10.3390/info17050481</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/481</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/480">

	<title>Information, Vol. 17, Pages 480: EC-MFR: A Hierarchical Edge&amp;ndash;Cloud Collaborative Framework for Multimodal Fact-Checking</title>
	<link>https://www.mdpi.com/2078-2489/17/5/480</link>
	<description>The spread of multimodal misinformation demands verification that is both accurate and fast while keeping knowledge current. Large language models are powerful but costly and slow, and their static knowledge can lag behind events. We introduce EC-MFR, a hierarchical framework that divides work between edge and the cloud. The system first optionally decomposes the claim into a few targeted sub-claims to guide retrieval, retrieves text and image evidence, and then compresses it into a small set of question&amp;amp;ndash;answer items using a lightweight, quantized multimodal language model deployed at the edge. A compact verifier on the edge predicts a label with calibrated confidence. If confidence is high, the decision is returned immediately. If confidence is low, the claim is sent to the cloud where retrieval can be expanded and the reasoning can be redone by a stronger verifier. This design offers three core benefits. It makes reasoning explicit through question&amp;amp;ndash;answer items, which shortens prompts and improves auditability. It improves retrieval recall via a light decomposition step that produces targeted sub-queries. Finally, it lets most easy claims finish on the edge to reduce cost and latency while preserving accuracy on difficult claims by allowing the cloud to broaden evidence and refine reasoning. Experiments on MOCHEG and AVERITEC validate the approach. Notably, EC-MFR achieves highly competitive accuracy of 54.10% on the multimodal MOCHEG dataset, and reaches 68.80% on AVERITEC under realistic retrieval settings, outperforming the GPT-4o cloud-only baseline by 6.6 percentage points. Furthermore, system-level profiling on edge hardware demonstrates that EC-MFR reduces processing costs by 51.8% and accelerates inference latency by 2.4&amp;amp;times; for edge-resolved claims, confirming a highly favorable accuracy&amp;amp;ndash;efficiency trade-off compared to existing multimodal fact-checking systems. We also formalize routing and efficiency and analyze calibration and retrieval.</description>
	<pubDate>2026-05-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 480: EC-MFR: A Hierarchical Edge&amp;ndash;Cloud Collaborative Framework for Multimodal Fact-Checking</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/480">doi: 10.3390/info17050480</a></p>
	<p>Authors:
		Hao Tao
		Tao Chen
		</p>
	<p>The spread of multimodal misinformation demands verification that is both accurate and fast while keeping knowledge current. Large language models are powerful but costly and slow, and their static knowledge can lag behind events. We introduce EC-MFR, a hierarchical framework that divides work between edge and the cloud. The system first optionally decomposes the claim into a few targeted sub-claims to guide retrieval, retrieves text and image evidence, and then compresses it into a small set of question&amp;amp;ndash;answer items using a lightweight, quantized multimodal language model deployed at the edge. A compact verifier on the edge predicts a label with calibrated confidence. If confidence is high, the decision is returned immediately. If confidence is low, the claim is sent to the cloud where retrieval can be expanded and the reasoning can be redone by a stronger verifier. This design offers three core benefits. It makes reasoning explicit through question&amp;amp;ndash;answer items, which shortens prompts and improves auditability. It improves retrieval recall via a light decomposition step that produces targeted sub-queries. Finally, it lets most easy claims finish on the edge to reduce cost and latency while preserving accuracy on difficult claims by allowing the cloud to broaden evidence and refine reasoning. Experiments on MOCHEG and AVERITEC validate the approach. Notably, EC-MFR achieves highly competitive accuracy of 54.10% on the multimodal MOCHEG dataset, and reaches 68.80% on AVERITEC under realistic retrieval settings, outperforming the GPT-4o cloud-only baseline by 6.6 percentage points. Furthermore, system-level profiling on edge hardware demonstrates that EC-MFR reduces processing costs by 51.8% and accelerates inference latency by 2.4&amp;amp;times; for edge-resolved claims, confirming a highly favorable accuracy&amp;amp;ndash;efficiency trade-off compared to existing multimodal fact-checking systems. We also formalize routing and efficiency and analyze calibration and retrieval.</p>
	]]></content:encoded>

	<dc:title>EC-MFR: A Hierarchical Edge&amp;amp;ndash;Cloud Collaborative Framework for Multimodal Fact-Checking</dc:title>
			<dc:creator>Hao Tao</dc:creator>
			<dc:creator>Tao Chen</dc:creator>
		<dc:identifier>doi: 10.3390/info17050480</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>480</prism:startingPage>
		<prism:doi>10.3390/info17050480</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/480</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/479">

	<title>Information, Vol. 17, Pages 479: User Acceptance of a Proposed Static-Dynamic Employment Recommendation Approach Among Computer Science Graduating Students</title>
	<link>https://www.mdpi.com/2078-2489/17/5/479</link>
	<description>Employment recommendation services are increasingly used to support graduate job search. However, limited research has examined how graduating computer science students perceive a proposed employment recommendation approach that combines static profile-based matching with dynamic interactive functions. Drawing primarily on the Technology Acceptance Model (TAM), with selected dimensions of the Information System (IS) Success Model used as supplement, this study conducted an exploratory questionnaire-based survey of 386 graduating students. The respondents evaluated existing employment recommendation systems and provided open-ended comments, and the findings show that only 38.3% of respondents reported willingness to use existing employment recommendation systems for job hunting. The main reported problems were delayed matching to individual qualifications (71.0%), information lag (55.4%), and jobs not matching students&amp;amp;rsquo; majors (54.1%). In contrast, respondents expressed relatively favorable attitudes toward the proposed static-dynamic approach: 67.6% indicated willingness to use it and 59.6% indicated willingness to recommend it to others. Exploratory subgroup analyses further suggested that positive evaluations of the proposed approach were higher among students from emerging computing fields and those with more active job-seeking engagement (p &amp;amp;lt; 0.05). Overall, the findings provide exploratory evidence that graduating computer science students may respond more positively to employment recommendation concepts that integrate profile-based matching with dynamic interaction. However, it is a proposed design concept, not an implemented system, evaluated by the respondents. Therefore, the results should be interpreted as perceptions and stated intentions, instead of evidence of actual adoption or real-world system effectiveness.</description>
	<pubDate>2026-05-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 479: User Acceptance of a Proposed Static-Dynamic Employment Recommendation Approach Among Computer Science Graduating Students</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/479">doi: 10.3390/info17050479</a></p>
	<p>Authors:
		Huafeng Qu
		Shafrida Sahrani
		Fariza Fauzi
		Xiacheng Song
		Yanfeng Zhao
		</p>
	<p>Employment recommendation services are increasingly used to support graduate job search. However, limited research has examined how graduating computer science students perceive a proposed employment recommendation approach that combines static profile-based matching with dynamic interactive functions. Drawing primarily on the Technology Acceptance Model (TAM), with selected dimensions of the Information System (IS) Success Model used as supplement, this study conducted an exploratory questionnaire-based survey of 386 graduating students. The respondents evaluated existing employment recommendation systems and provided open-ended comments, and the findings show that only 38.3% of respondents reported willingness to use existing employment recommendation systems for job hunting. The main reported problems were delayed matching to individual qualifications (71.0%), information lag (55.4%), and jobs not matching students&amp;amp;rsquo; majors (54.1%). In contrast, respondents expressed relatively favorable attitudes toward the proposed static-dynamic approach: 67.6% indicated willingness to use it and 59.6% indicated willingness to recommend it to others. Exploratory subgroup analyses further suggested that positive evaluations of the proposed approach were higher among students from emerging computing fields and those with more active job-seeking engagement (p &amp;amp;lt; 0.05). Overall, the findings provide exploratory evidence that graduating computer science students may respond more positively to employment recommendation concepts that integrate profile-based matching with dynamic interaction. However, it is a proposed design concept, not an implemented system, evaluated by the respondents. Therefore, the results should be interpreted as perceptions and stated intentions, instead of evidence of actual adoption or real-world system effectiveness.</p>
	]]></content:encoded>

	<dc:title>User Acceptance of a Proposed Static-Dynamic Employment Recommendation Approach Among Computer Science Graduating Students</dc:title>
			<dc:creator>Huafeng Qu</dc:creator>
			<dc:creator>Shafrida Sahrani</dc:creator>
			<dc:creator>Fariza Fauzi</dc:creator>
			<dc:creator>Xiacheng Song</dc:creator>
			<dc:creator>Yanfeng Zhao</dc:creator>
		<dc:identifier>doi: 10.3390/info17050479</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>479</prism:startingPage>
		<prism:doi>10.3390/info17050479</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/479</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/478">

	<title>Information, Vol. 17, Pages 478: Application of Blockchain Technologies and Smart Contracts for the Storage and Verification of Academic Transcripts in the Higher Education Systems</title>
	<link>https://www.mdpi.com/2078-2489/17/5/478</link>
	<description>This article discusses the practical implementation of a prototype academic transcript storage system based on blockchain technology and smart contracts. The digital transformation of higher education requires reliable mechanisms for ensuring the integrity and verifiability of academic documents. It presents the design and experimental validation of a blockchain-based system for storing and verifying academic transcripts within the higher education system of the Republic of Kazakhstan. The proposed solution is based on an Ethereum Virtual Machine-compatible smart contract implemented in Solidity and deployed on a test network. The testnet was used as the experimental environment, and transaction monitoring was performed using the BlockScout v11.0.3 explorer. The architecture of the TranscriptStorage smart contract is presented, including a role-based access model, a data indexing mechanism using keccak-256, and storage of transcripts in a mapping structure (bytes32 =&amp;amp;gt; Transcript[ ]). The experimental results confirm the successful recording of the Transcript in the distributed ledger, event recording (Logs), and the correctness of the ABI encoding of input parameters (Raw Input), as well as a change in state (State Changes) reflecting the fee payment. The use of events is shown to enable cost-effective third-party data verification without the need to store the entire text in the contract state. The comparative results showed that the proposed system reduced gas consumption by 804.5% compared to Blockcerts, 48.8% compared to ECertChain, 82.5% compared to ShikkhaChain, and 43.5% compared to zkEVM. These improvements were achieved while maintaining high scalability, robust privacy features, and security, making it a practical solution for Kazakhstan&amp;amp;rsquo;s educational system.</description>
	<pubDate>2026-05-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 478: Application of Blockchain Technologies and Smart Contracts for the Storage and Verification of Academic Transcripts in the Higher Education Systems</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/478">doi: 10.3390/info17050478</a></p>
	<p>Authors:
		Olga Ussatova
		Vladislav Karyukin
		Yenlik Begimbayeva
		Galimkair Mutanov
		Yerlan Kistaubayev
		Medet Turdaliyev
		</p>
	<p>This article discusses the practical implementation of a prototype academic transcript storage system based on blockchain technology and smart contracts. The digital transformation of higher education requires reliable mechanisms for ensuring the integrity and verifiability of academic documents. It presents the design and experimental validation of a blockchain-based system for storing and verifying academic transcripts within the higher education system of the Republic of Kazakhstan. The proposed solution is based on an Ethereum Virtual Machine-compatible smart contract implemented in Solidity and deployed on a test network. The testnet was used as the experimental environment, and transaction monitoring was performed using the BlockScout v11.0.3 explorer. The architecture of the TranscriptStorage smart contract is presented, including a role-based access model, a data indexing mechanism using keccak-256, and storage of transcripts in a mapping structure (bytes32 =&amp;amp;gt; Transcript[ ]). The experimental results confirm the successful recording of the Transcript in the distributed ledger, event recording (Logs), and the correctness of the ABI encoding of input parameters (Raw Input), as well as a change in state (State Changes) reflecting the fee payment. The use of events is shown to enable cost-effective third-party data verification without the need to store the entire text in the contract state. The comparative results showed that the proposed system reduced gas consumption by 804.5% compared to Blockcerts, 48.8% compared to ECertChain, 82.5% compared to ShikkhaChain, and 43.5% compared to zkEVM. These improvements were achieved while maintaining high scalability, robust privacy features, and security, making it a practical solution for Kazakhstan&amp;amp;rsquo;s educational system.</p>
	]]></content:encoded>

	<dc:title>Application of Blockchain Technologies and Smart Contracts for the Storage and Verification of Academic Transcripts in the Higher Education Systems</dc:title>
			<dc:creator>Olga Ussatova</dc:creator>
			<dc:creator>Vladislav Karyukin</dc:creator>
			<dc:creator>Yenlik Begimbayeva</dc:creator>
			<dc:creator>Galimkair Mutanov</dc:creator>
			<dc:creator>Yerlan Kistaubayev</dc:creator>
			<dc:creator>Medet Turdaliyev</dc:creator>
		<dc:identifier>doi: 10.3390/info17050478</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>478</prism:startingPage>
		<prism:doi>10.3390/info17050478</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/478</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/477">

	<title>Information, Vol. 17, Pages 477: An Overview of Recent Interpretability and Explainability Approaches for Tree-Based Ensembles</title>
	<link>https://www.mdpi.com/2078-2489/17/5/477</link>
	<description>Decision tree ensembles, such as Random Forests and Gradient Boosting Machines, achieve high predictive accuracy but often suffer from limited transparency due to their structural complexity. Due to this lack, interpretability challenges arise in domains where model understanding, accountability, and trust are essential. So, many interpretability/explainability techniques have been proposed for tree-based ensembles. However, although there are enough surveys or overviews concerning interpretability/explainability in artificial intelligence or machine learning in general, there are very few surveys and overviews on interpretability/explainability for tree-based ensembles. This paper provides an overview of recent approaches to interpretability and explainability in decision tree ensembles. We present two categorizations: one based on the kind of technique/architecture used and the second based on the level of scope. The former is a unified taxonomy of acquired (or post hoc) and inherent methods further analyzed in two more levels. The latter concerns the distinction between local (or instance-related) and global (or model-related) methods. We additionally provide a survey of the interpretability/explainability methods/techniques used in various domain applications, like healthcare, finance, law, and privacy preservation. This overview clarifies the current landscape of interpretable/explainable ensemble learning, explicitly addressing emerging challenges. Ultimately, it aims to support researchers and practitioners in selecting and developing ensemble models that move beyond the traditional accuracy&amp;amp;ndash;interpretability trade-off, aligning predictive power with strict regulatory, operational, and domain-specific transparency requirements.</description>
	<pubDate>2026-05-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 477: An Overview of Recent Interpretability and Explainability Approaches for Tree-Based Ensembles</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/477">doi: 10.3390/info17050477</a></p>
	<p>Authors:
		Alexandros Miteloudis
		Ioannis Hatzilygeroudis
		</p>
	<p>Decision tree ensembles, such as Random Forests and Gradient Boosting Machines, achieve high predictive accuracy but often suffer from limited transparency due to their structural complexity. Due to this lack, interpretability challenges arise in domains where model understanding, accountability, and trust are essential. So, many interpretability/explainability techniques have been proposed for tree-based ensembles. However, although there are enough surveys or overviews concerning interpretability/explainability in artificial intelligence or machine learning in general, there are very few surveys and overviews on interpretability/explainability for tree-based ensembles. This paper provides an overview of recent approaches to interpretability and explainability in decision tree ensembles. We present two categorizations: one based on the kind of technique/architecture used and the second based on the level of scope. The former is a unified taxonomy of acquired (or post hoc) and inherent methods further analyzed in two more levels. The latter concerns the distinction between local (or instance-related) and global (or model-related) methods. We additionally provide a survey of the interpretability/explainability methods/techniques used in various domain applications, like healthcare, finance, law, and privacy preservation. This overview clarifies the current landscape of interpretable/explainable ensemble learning, explicitly addressing emerging challenges. Ultimately, it aims to support researchers and practitioners in selecting and developing ensemble models that move beyond the traditional accuracy&amp;amp;ndash;interpretability trade-off, aligning predictive power with strict regulatory, operational, and domain-specific transparency requirements.</p>
	]]></content:encoded>

	<dc:title>An Overview of Recent Interpretability and Explainability Approaches for Tree-Based Ensembles</dc:title>
			<dc:creator>Alexandros Miteloudis</dc:creator>
			<dc:creator>Ioannis Hatzilygeroudis</dc:creator>
		<dc:identifier>doi: 10.3390/info17050477</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>477</prism:startingPage>
		<prism:doi>10.3390/info17050477</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/477</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/476">

	<title>Information, Vol. 17, Pages 476: Human&amp;ndash;AI Collaboration in Risk- and Uncertainty-Aware Portfolio Reinforcement Learning: A Critical Review</title>
	<link>https://www.mdpi.com/2078-2489/17/5/476</link>
	<description>Financial markets are characterized by non-stationarity, regime shifts, and complex cross-asset interactions, which challenge traditional portfolio optimization and motivate reinforcement learning (RL) for adaptive decision-making. However, many RL-based approaches remain predominantly return-centric, with risk, uncertainty, and human oversight only weakly integrated, limiting robustness and practical applicability. This review provides a critical synthesis of risk-aware and uncertainty-sensitive reinforcement learning for portfolio optimization from a human&amp;amp;ndash;AI collaboration perspective. We analyze major architectural paradigms&amp;amp;mdash;including single-agent, hierarchical, multi-agent, and modular systems&amp;amp;mdash;together with risk modeling strategies (e.g., reward shaping, constraint-based optimization, and downside risk measures such as CVaR) and probabilistic approaches to uncertainty estimation (e.g., Bayesian neural networks, Monte Carlo dropout, and ensembles). A structured analysis of 57 fully assessed studies reveals that only 5 (9%) explicitly couple uncertainty estimation with risk constraint mechanisms, while 38 (69%) treat risk and uncertainty as structurally independent components. We identify a central structural limitation: risk objectives are rarely conditioned on epistemic uncertainty, while uncertainty estimates seldom influence constraint mechanisms or capital allocation. This decoupling leads to fragmented frameworks that remain difficult to deploy in real financial environments. By integrating architectural design, risk modeling, uncertainty estimation, and evaluation practices, this review proposes a unified, deployment-oriented perspective for developing governance-aligned portfolio decision-support systems.</description>
	<pubDate>2026-05-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 476: Human&amp;ndash;AI Collaboration in Risk- and Uncertainty-Aware Portfolio Reinforcement Learning: A Critical Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/476">doi: 10.3390/info17050476</a></p>
	<p>Authors:
		Firdaous Khemlichi
		Youness Idrissi Khamlichi
		Safae Elhaj Ben Ali
		</p>
	<p>Financial markets are characterized by non-stationarity, regime shifts, and complex cross-asset interactions, which challenge traditional portfolio optimization and motivate reinforcement learning (RL) for adaptive decision-making. However, many RL-based approaches remain predominantly return-centric, with risk, uncertainty, and human oversight only weakly integrated, limiting robustness and practical applicability. This review provides a critical synthesis of risk-aware and uncertainty-sensitive reinforcement learning for portfolio optimization from a human&amp;amp;ndash;AI collaboration perspective. We analyze major architectural paradigms&amp;amp;mdash;including single-agent, hierarchical, multi-agent, and modular systems&amp;amp;mdash;together with risk modeling strategies (e.g., reward shaping, constraint-based optimization, and downside risk measures such as CVaR) and probabilistic approaches to uncertainty estimation (e.g., Bayesian neural networks, Monte Carlo dropout, and ensembles). A structured analysis of 57 fully assessed studies reveals that only 5 (9%) explicitly couple uncertainty estimation with risk constraint mechanisms, while 38 (69%) treat risk and uncertainty as structurally independent components. We identify a central structural limitation: risk objectives are rarely conditioned on epistemic uncertainty, while uncertainty estimates seldom influence constraint mechanisms or capital allocation. This decoupling leads to fragmented frameworks that remain difficult to deploy in real financial environments. By integrating architectural design, risk modeling, uncertainty estimation, and evaluation practices, this review proposes a unified, deployment-oriented perspective for developing governance-aligned portfolio decision-support systems.</p>
	]]></content:encoded>

	<dc:title>Human&amp;amp;ndash;AI Collaboration in Risk- and Uncertainty-Aware Portfolio Reinforcement Learning: A Critical Review</dc:title>
			<dc:creator>Firdaous Khemlichi</dc:creator>
			<dc:creator>Youness Idrissi Khamlichi</dc:creator>
			<dc:creator>Safae Elhaj Ben Ali</dc:creator>
		<dc:identifier>doi: 10.3390/info17050476</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Systematic Review</prism:section>
	<prism:startingPage>476</prism:startingPage>
		<prism:doi>10.3390/info17050476</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/476</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/475">

	<title>Information, Vol. 17, Pages 475: A Multi-Chatbot Analysis: Strengths and Weaknesses in Neuroanatomy Learning</title>
	<link>https://www.mdpi.com/2078-2489/17/5/475</link>
	<description>Background: The expanding interest in chatbots within the medical domain underscores the imperative for a comprehensive understanding of their capabilities and limitations, particularly in the context of anatomical education. Chatbots possess the potential to comprehend intricate anatomical concepts, deliver both advanced and contextually relevant information, and serve as a valuable resource for medical students and educators. This study aimed to evaluate the proficiency and constraints of chatbots in the domain of neuroanatomy. Methods: We developed 30 questions and administered them to ChatGPT-4, Google Gemini, Microsoft Copilot, and Perplexity.ai in their open versions. Questions were collaboratively constructed by the research team, selected through a semi-randomized process within the domain of neuroanatomy. Chatbots&amp;amp;rsquo; responses were evaluated in a blinded manner for validity and appropriateness, utilizing a 5-point Likert scale. Results: The highest observed performance among the evaluated chatbots was exhibited by ChatGPT-4 and Perplexity.ai, which achieved scores of 4.6 &amp;amp;plusmn; 0.5 and 4.5 &amp;amp;plusmn; 0.5, respectively. Microsoft Copilot (4.4 &amp;amp;plusmn; 0.5) and Google Gemini (4.1 &amp;amp;plusmn; 1.0) followed. The least successful performance was observed in the task of generating a neuroanatomical structure: only Microsoft Copilot attempted to fulfil the request, albeit with a dramatically flawed outcome. Conversely, Google Gemini and Perplexity.ai provided web links to anatomical illustrations. Conclusions: Despite technological advancements, AI models have not yet reached a level of sophistication sufficient to entirely supplant the role of educators or facilitators in a neuroanatomy course; however, they can serve as valuable adjunct tools for medical educators and students when utilized with careful consideration.</description>
	<pubDate>2026-05-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 475: A Multi-Chatbot Analysis: Strengths and Weaknesses in Neuroanatomy Learning</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/475">doi: 10.3390/info17050475</a></p>
	<p>Authors:
		Alessandro Naim
		Sara Naim
		Daniele Saverino
		</p>
	<p>Background: The expanding interest in chatbots within the medical domain underscores the imperative for a comprehensive understanding of their capabilities and limitations, particularly in the context of anatomical education. Chatbots possess the potential to comprehend intricate anatomical concepts, deliver both advanced and contextually relevant information, and serve as a valuable resource for medical students and educators. This study aimed to evaluate the proficiency and constraints of chatbots in the domain of neuroanatomy. Methods: We developed 30 questions and administered them to ChatGPT-4, Google Gemini, Microsoft Copilot, and Perplexity.ai in their open versions. Questions were collaboratively constructed by the research team, selected through a semi-randomized process within the domain of neuroanatomy. Chatbots&amp;amp;rsquo; responses were evaluated in a blinded manner for validity and appropriateness, utilizing a 5-point Likert scale. Results: The highest observed performance among the evaluated chatbots was exhibited by ChatGPT-4 and Perplexity.ai, which achieved scores of 4.6 &amp;amp;plusmn; 0.5 and 4.5 &amp;amp;plusmn; 0.5, respectively. Microsoft Copilot (4.4 &amp;amp;plusmn; 0.5) and Google Gemini (4.1 &amp;amp;plusmn; 1.0) followed. The least successful performance was observed in the task of generating a neuroanatomical structure: only Microsoft Copilot attempted to fulfil the request, albeit with a dramatically flawed outcome. Conversely, Google Gemini and Perplexity.ai provided web links to anatomical illustrations. Conclusions: Despite technological advancements, AI models have not yet reached a level of sophistication sufficient to entirely supplant the role of educators or facilitators in a neuroanatomy course; however, they can serve as valuable adjunct tools for medical educators and students when utilized with careful consideration.</p>
	]]></content:encoded>

	<dc:title>A Multi-Chatbot Analysis: Strengths and Weaknesses in Neuroanatomy Learning</dc:title>
			<dc:creator>Alessandro Naim</dc:creator>
			<dc:creator>Sara Naim</dc:creator>
			<dc:creator>Daniele Saverino</dc:creator>
		<dc:identifier>doi: 10.3390/info17050475</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>475</prism:startingPage>
		<prism:doi>10.3390/info17050475</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/475</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/474">

	<title>Information, Vol. 17, Pages 474: Unsupervised Head PD-to-T2 MR Image Translation via Multi-Scale Feature Regularization</title>
	<link>https://www.mdpi.com/2078-2489/17/5/474</link>
	<description>Unsupervised medical image translation remains challenging because model development often relies on unpaired training, whereas reliable evaluation requires well-matched reference images. PD-weighted and T2-weighted brain MR images provide a useful testbed for this problem because they are closely matched anatomically while still exhibiting distinct contrast characteristics. Existing methods often align only high-level features, overlooking low-level texture details that are important for structural fidelity. In this work, we propose the Multi-Scale Feature Regularization and Patch Mixup (MSFRPM) framework based on an encoder&amp;amp;ndash;decoder architecture. It aligns cross-domain features across multiple scales to preserve local details and employs a patch-based mixup strategy to augment training data. The framework was evaluated using an unsupervised learning protocol with strict data partitioning. Experimental results demonstrate that MSFRPM achieves strong performance relative to eight state-of-the-art methods. Our approach achieved improvements in MAE (6.26 &amp;amp;plusmn; 0.86), PSNR (23.53 &amp;amp;plusmn; 0.92), SSIM (0.83 &amp;amp;plusmn; 0.03), and GMSD (0.100 &amp;amp;plusmn; 0.010). Qualitative assessments confirmed improved structural fidelity, and t-SNE visualization validated enhanced cross-domain feature alignment. Overall, MSFRPM provides a useful approach for unsupervised PD-to-T2 image translation under the current experimental setting.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 474: Unsupervised Head PD-to-T2 MR Image Translation via Multi-Scale Feature Regularization</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/474">doi: 10.3390/info17050474</a></p>
	<p>Authors:
		Xu Chen
		Yuntian Bai
		Yifeng Hong
		</p>
	<p>Unsupervised medical image translation remains challenging because model development often relies on unpaired training, whereas reliable evaluation requires well-matched reference images. PD-weighted and T2-weighted brain MR images provide a useful testbed for this problem because they are closely matched anatomically while still exhibiting distinct contrast characteristics. Existing methods often align only high-level features, overlooking low-level texture details that are important for structural fidelity. In this work, we propose the Multi-Scale Feature Regularization and Patch Mixup (MSFRPM) framework based on an encoder&amp;amp;ndash;decoder architecture. It aligns cross-domain features across multiple scales to preserve local details and employs a patch-based mixup strategy to augment training data. The framework was evaluated using an unsupervised learning protocol with strict data partitioning. Experimental results demonstrate that MSFRPM achieves strong performance relative to eight state-of-the-art methods. Our approach achieved improvements in MAE (6.26 &amp;amp;plusmn; 0.86), PSNR (23.53 &amp;amp;plusmn; 0.92), SSIM (0.83 &amp;amp;plusmn; 0.03), and GMSD (0.100 &amp;amp;plusmn; 0.010). Qualitative assessments confirmed improved structural fidelity, and t-SNE visualization validated enhanced cross-domain feature alignment. Overall, MSFRPM provides a useful approach for unsupervised PD-to-T2 image translation under the current experimental setting.</p>
	]]></content:encoded>

	<dc:title>Unsupervised Head PD-to-T2 MR Image Translation via Multi-Scale Feature Regularization</dc:title>
			<dc:creator>Xu Chen</dc:creator>
			<dc:creator>Yuntian Bai</dc:creator>
			<dc:creator>Yifeng Hong</dc:creator>
		<dc:identifier>doi: 10.3390/info17050474</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>474</prism:startingPage>
		<prism:doi>10.3390/info17050474</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/474</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/473">

	<title>Information, Vol. 17, Pages 473: Preference-Guided Debiasing and Denoising Social Recommendation</title>
	<link>https://www.mdpi.com/2078-2489/17/5/473</link>
	<description>User behaviors and social interactions on online platforms are intricately intertwined, naturally forming complex graph structures. Leveraging this structure, Graph Neural Networks (GNNs) efficiently aggregate neighborhood information and have become a prevailing paradigm for social recommendation. However, existing methods often overemphasize social modeling while overlooking the joint effects of preference-guided relation filtering and user/item biases, rendering them vulnerable to noise from redundant ties. To address these limitations, we propose PDDSR, a Preference-Guided Debiasing and Denoising Social Recommendation framework. Specifically, for debiasing, PDDSR explicitly models user rating bias and item popularity bias as learnable vectors, integrating them into embedding learning to mitigate bias drift at the embedding level. Simultaneously, for denoising, the model employs a social relation confidence mechanism guided by user preferences and adopts an adaptive graph denoising strategy to retain highly informative connections, effectively capturing social influence while filtering out noise. Extensive experiments on the Ciao and Epinions datasets demonstrate that PDDSR consistently outperforms state-of-the-art methods, and notably on the Ciao dataset, the MAE and RMSE are improved by 1.90% and 1.87%, respectively. These results validate the effectiveness and robustness of the joint debiasing and denoising mechanism in complex social recommendation scenarios.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 473: Preference-Guided Debiasing and Denoising Social Recommendation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/473">doi: 10.3390/info17050473</a></p>
	<p>Authors:
		Jun Li
		Shenghan Li
		Huachang Zeng
		Shengda Zhuo
		</p>
	<p>User behaviors and social interactions on online platforms are intricately intertwined, naturally forming complex graph structures. Leveraging this structure, Graph Neural Networks (GNNs) efficiently aggregate neighborhood information and have become a prevailing paradigm for social recommendation. However, existing methods often overemphasize social modeling while overlooking the joint effects of preference-guided relation filtering and user/item biases, rendering them vulnerable to noise from redundant ties. To address these limitations, we propose PDDSR, a Preference-Guided Debiasing and Denoising Social Recommendation framework. Specifically, for debiasing, PDDSR explicitly models user rating bias and item popularity bias as learnable vectors, integrating them into embedding learning to mitigate bias drift at the embedding level. Simultaneously, for denoising, the model employs a social relation confidence mechanism guided by user preferences and adopts an adaptive graph denoising strategy to retain highly informative connections, effectively capturing social influence while filtering out noise. Extensive experiments on the Ciao and Epinions datasets demonstrate that PDDSR consistently outperforms state-of-the-art methods, and notably on the Ciao dataset, the MAE and RMSE are improved by 1.90% and 1.87%, respectively. These results validate the effectiveness and robustness of the joint debiasing and denoising mechanism in complex social recommendation scenarios.</p>
	]]></content:encoded>

	<dc:title>Preference-Guided Debiasing and Denoising Social Recommendation</dc:title>
			<dc:creator>Jun Li</dc:creator>
			<dc:creator>Shenghan Li</dc:creator>
			<dc:creator>Huachang Zeng</dc:creator>
			<dc:creator>Shengda Zhuo</dc:creator>
		<dc:identifier>doi: 10.3390/info17050473</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>473</prism:startingPage>
		<prism:doi>10.3390/info17050473</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/473</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/472">

	<title>Information, Vol. 17, Pages 472: Rethinking Cultural UX Evaluation: A Taxonomy for Contextual and Mixed-Methods Research</title>
	<link>https://www.mdpi.com/2078-2489/17/5/472</link>
	<description>Cultural heritage experiences present unique challenges for user experience (UX) evaluation due to their diversity, contextual variability, and the growing need to balance methodological rigor with low cognitive effort. Traditional UX frameworks often assume a one-size-fits-all approach, which fails to address the complexity of cultural heritage environments. This paper introduces a flexible taxonomy of UX evaluation methodologies designed as a decision-support tool for researchers and practitioners. The taxonomy is built on 11 core dimensions: study type, research phase, research objective, evaluation timing, data nature, facilitation setup, observation setup, research environment, participant profile, cognitive burden, and evaluation standards and instruments. Rather than prescribing a single method, the taxonomy enables the selection and combination of qualitative and quantitative approaches tailored to the context and phase of each cultural heritage project. Representative examples illustrate its application in guiding mixed-methods strategies for measuring cultural resonance. By promoting adaptability and methodological diversity, this work advances human-centered UX evaluation practices for cultural heritage and beyond.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 472: Rethinking Cultural UX Evaluation: A Taxonomy for Contextual and Mixed-Methods Research</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/472">doi: 10.3390/info17050472</a></p>
	<p>Authors:
		Fotios Pastrakis
		Markos Konstantakis
		George Caridakis
		</p>
	<p>Cultural heritage experiences present unique challenges for user experience (UX) evaluation due to their diversity, contextual variability, and the growing need to balance methodological rigor with low cognitive effort. Traditional UX frameworks often assume a one-size-fits-all approach, which fails to address the complexity of cultural heritage environments. This paper introduces a flexible taxonomy of UX evaluation methodologies designed as a decision-support tool for researchers and practitioners. The taxonomy is built on 11 core dimensions: study type, research phase, research objective, evaluation timing, data nature, facilitation setup, observation setup, research environment, participant profile, cognitive burden, and evaluation standards and instruments. Rather than prescribing a single method, the taxonomy enables the selection and combination of qualitative and quantitative approaches tailored to the context and phase of each cultural heritage project. Representative examples illustrate its application in guiding mixed-methods strategies for measuring cultural resonance. By promoting adaptability and methodological diversity, this work advances human-centered UX evaluation practices for cultural heritage and beyond.</p>
	]]></content:encoded>

	<dc:title>Rethinking Cultural UX Evaluation: A Taxonomy for Contextual and Mixed-Methods Research</dc:title>
			<dc:creator>Fotios Pastrakis</dc:creator>
			<dc:creator>Markos Konstantakis</dc:creator>
			<dc:creator>George Caridakis</dc:creator>
		<dc:identifier>doi: 10.3390/info17050472</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>472</prism:startingPage>
		<prism:doi>10.3390/info17050472</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/472</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/471">

	<title>Information, Vol. 17, Pages 471: Smart Monikers with Multi-Peer Approach for Privacy Protection in the Dynamic Environments</title>
	<link>https://www.mdpi.com/2078-2489/17/5/471</link>
	<description>Protecting the privacy of users&amp;amp;rsquo; data while maintaining reliability and accuracy in crowded events remains an open issue, especially with the growing capabilities and resources of attackers. This challenge becomes more difficult in dynamic environments with moving users/devices. Unfortunately, the current privacy-preserving methods suffer from several drawbacks that include reliability and accuracy of results, the need to fully trust a third party, or the incurrence of heavy overheads. This research presents a novel approach that is enhanced by peer cooperation, which is one of the most suitable techniques for crowded environments. The proposed approach is called &amp;amp;ldquo;Smart Monikers with Multi-Peer Cooperation (SM2Peer)&amp;amp;rdquo;. The SM2Peer addresses all the drawbacks of the traditional peer cooperation approach through two scenarios. In addition, the SM2Peer exploits the fog computing layer to control the cooperation among peers effectively, where each fog node manages several peers with smart moniker management. Moreover, SM2Peer provides multiple caches to relax the total overhead. The simulation and comparison with other common privacy approaches show the superiority of the SM2Peer in many aspects and metrics of privacy without a significant effect on performance.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 471: Smart Monikers with Multi-Peer Approach for Privacy Protection in the Dynamic Environments</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/471">doi: 10.3390/info17050471</a></p>
	<p>Authors:
		Adnan Ahmed Abi Sen
		Adel Ben Mnaouer
		Omar Tayan
		Abdullah M. Basahel
		Nour Mahmoud Bahbouh
		Sanaa Askool
		</p>
	<p>Protecting the privacy of users&amp;amp;rsquo; data while maintaining reliability and accuracy in crowded events remains an open issue, especially with the growing capabilities and resources of attackers. This challenge becomes more difficult in dynamic environments with moving users/devices. Unfortunately, the current privacy-preserving methods suffer from several drawbacks that include reliability and accuracy of results, the need to fully trust a third party, or the incurrence of heavy overheads. This research presents a novel approach that is enhanced by peer cooperation, which is one of the most suitable techniques for crowded environments. The proposed approach is called &amp;amp;ldquo;Smart Monikers with Multi-Peer Cooperation (SM2Peer)&amp;amp;rdquo;. The SM2Peer addresses all the drawbacks of the traditional peer cooperation approach through two scenarios. In addition, the SM2Peer exploits the fog computing layer to control the cooperation among peers effectively, where each fog node manages several peers with smart moniker management. Moreover, SM2Peer provides multiple caches to relax the total overhead. The simulation and comparison with other common privacy approaches show the superiority of the SM2Peer in many aspects and metrics of privacy without a significant effect on performance.</p>
	]]></content:encoded>

	<dc:title>Smart Monikers with Multi-Peer Approach for Privacy Protection in the Dynamic Environments</dc:title>
			<dc:creator>Adnan Ahmed Abi Sen</dc:creator>
			<dc:creator>Adel Ben Mnaouer</dc:creator>
			<dc:creator>Omar Tayan</dc:creator>
			<dc:creator>Abdullah M. Basahel</dc:creator>
			<dc:creator>Nour Mahmoud Bahbouh</dc:creator>
			<dc:creator>Sanaa Askool</dc:creator>
		<dc:identifier>doi: 10.3390/info17050471</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>471</prism:startingPage>
		<prism:doi>10.3390/info17050471</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/471</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/470">

	<title>Information, Vol. 17, Pages 470: Exploratory Research of Integrating Large Language Models and Grounded Theory: Scientific and Technological Intelligence Case Study</title>
	<link>https://www.mdpi.com/2078-2489/17/5/470</link>
	<description>This study addresses the need to transform enterprise scientific and technological intelligence (STI) services from a discrete resource-supply model toward a more systematic value-creation approach, an important challenge in the digital transformation of knowledge-intensive industries. As an exploratory qualitative inquiry, this work combines large language model-assisted analysis with grounded theory to examine the construction logic and operational mechanisms of an embedded intelligent STI service system. Drawing on in-depth interviews with STI professionals, a qualitative corpus was analyzed using human&amp;amp;ndash;machine collaborative coding to systematically derive and organize key constructs. The findings yield a preliminary three-layer conceptual framework: &amp;amp;ldquo;supply-demand interactive matching, organizational embedded services, and digital-intelligent platform support.&amp;amp;rdquo; Specifically, the supply&amp;amp;ndash;demand matching layer facilitates targeted alignment through demand insight, dynamic response, and quality closed-loop management; the organizational embedded service layer delivers intelligence through scenario integration, process integration, and responsibility&amp;amp;ndash;authority integration; and the digital-intelligent platform support layer enables core capabilities via data element induction, intelligent diffusion, and tacit knowledge conversion. The proposed framework offers an initial, structured perspective on how embedded intelligent STI services may operate, providing a foundational reference for both research and practice in this emerging domain.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 470: Exploratory Research of Integrating Large Language Models and Grounded Theory: Scientific and Technological Intelligence Case Study</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/470">doi: 10.3390/info17050470</a></p>
	<p>Authors:
		Yi Chen
		Yang Wang
		Hao Xu
		Anning Wang
		</p>
	<p>This study addresses the need to transform enterprise scientific and technological intelligence (STI) services from a discrete resource-supply model toward a more systematic value-creation approach, an important challenge in the digital transformation of knowledge-intensive industries. As an exploratory qualitative inquiry, this work combines large language model-assisted analysis with grounded theory to examine the construction logic and operational mechanisms of an embedded intelligent STI service system. Drawing on in-depth interviews with STI professionals, a qualitative corpus was analyzed using human&amp;amp;ndash;machine collaborative coding to systematically derive and organize key constructs. The findings yield a preliminary three-layer conceptual framework: &amp;amp;ldquo;supply-demand interactive matching, organizational embedded services, and digital-intelligent platform support.&amp;amp;rdquo; Specifically, the supply&amp;amp;ndash;demand matching layer facilitates targeted alignment through demand insight, dynamic response, and quality closed-loop management; the organizational embedded service layer delivers intelligence through scenario integration, process integration, and responsibility&amp;amp;ndash;authority integration; and the digital-intelligent platform support layer enables core capabilities via data element induction, intelligent diffusion, and tacit knowledge conversion. The proposed framework offers an initial, structured perspective on how embedded intelligent STI services may operate, providing a foundational reference for both research and practice in this emerging domain.</p>
	]]></content:encoded>

	<dc:title>Exploratory Research of Integrating Large Language Models and Grounded Theory: Scientific and Technological Intelligence Case Study</dc:title>
			<dc:creator>Yi Chen</dc:creator>
			<dc:creator>Yang Wang</dc:creator>
			<dc:creator>Hao Xu</dc:creator>
			<dc:creator>Anning Wang</dc:creator>
		<dc:identifier>doi: 10.3390/info17050470</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>470</prism:startingPage>
		<prism:doi>10.3390/info17050470</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/470</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/469">

	<title>Information, Vol. 17, Pages 469: Extending Taxonomies and Mapping P2P Credit Card Fraud (Carding) Forums on the Dark Web</title>
	<link>https://www.mdpi.com/2078-2489/17/5/469</link>
	<description>Credit card fraud constitutes a core component of the contemporary cybercrime economy, in which dark web carding forums play a pivotal role in coordinating, commoditising, and disseminating illicit activities. While prior research has primarily focused on transaction-level fraud detection, comparatively limited attention has been devoted to the systematic analysis of the social and organisational ecosystems within which these practices are enacted. This study addresses this gap by proposing and validating a domain-specific taxonomy for the automated classification of content in P2P carding forums. To this end, we adopt an iterative, data-driven methodology that integrates large language models (LLMs), lexical co-occurrence analysis, and semantic network analysis. Using a corpus of 3260 posts, we define and operationalise a taxonomy structured around four predicates: activity context, actor role, products and services, and technical tools, supported by a locally deployed LLM (Llama 4 Scout). A human-annotated subset was additionally used to evaluate inter-annotator agreement and standard classification metrics, complementing the coverage-based assessment and enabling comparison against a keyword-based baseline. Evaluation was further strengthened through manual benchmarking, confidence intervals, sensitivity analysis of key pipeline components, and comparison with alternative open-weight models. The results indicate that the proposed taxonomy achieves broad corpus-level representational coverage, with at least one semantic dimension identified in 98.71% of posts. However, coverage is uneven across predicates: activity-context is highly explicit, whereas actor-role and product-service show only moderate coverage and technique-tool remains substantially underrepresented and ambiguous. Overall, the findings show that combining domain-specific taxonomies with LLM-assisted classification and network analysis offers a robust framework for understanding and monitoring carding ecosystems in the dark web.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 469: Extending Taxonomies and Mapping P2P Credit Card Fraud (Carding) Forums on the Dark Web</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/469">doi: 10.3390/info17050469</a></p>
	<p>Authors:
		Jose-Amelio Medina-Merodio
		Mikel Ferrer-Oliva
		José Fernández López
		Alejandro Ruiz-Zambrano
		Adrián Domínguez-Díaz
		</p>
	<p>Credit card fraud constitutes a core component of the contemporary cybercrime economy, in which dark web carding forums play a pivotal role in coordinating, commoditising, and disseminating illicit activities. While prior research has primarily focused on transaction-level fraud detection, comparatively limited attention has been devoted to the systematic analysis of the social and organisational ecosystems within which these practices are enacted. This study addresses this gap by proposing and validating a domain-specific taxonomy for the automated classification of content in P2P carding forums. To this end, we adopt an iterative, data-driven methodology that integrates large language models (LLMs), lexical co-occurrence analysis, and semantic network analysis. Using a corpus of 3260 posts, we define and operationalise a taxonomy structured around four predicates: activity context, actor role, products and services, and technical tools, supported by a locally deployed LLM (Llama 4 Scout). A human-annotated subset was additionally used to evaluate inter-annotator agreement and standard classification metrics, complementing the coverage-based assessment and enabling comparison against a keyword-based baseline. Evaluation was further strengthened through manual benchmarking, confidence intervals, sensitivity analysis of key pipeline components, and comparison with alternative open-weight models. The results indicate that the proposed taxonomy achieves broad corpus-level representational coverage, with at least one semantic dimension identified in 98.71% of posts. However, coverage is uneven across predicates: activity-context is highly explicit, whereas actor-role and product-service show only moderate coverage and technique-tool remains substantially underrepresented and ambiguous. Overall, the findings show that combining domain-specific taxonomies with LLM-assisted classification and network analysis offers a robust framework for understanding and monitoring carding ecosystems in the dark web.</p>
	]]></content:encoded>

	<dc:title>Extending Taxonomies and Mapping P2P Credit Card Fraud (Carding) Forums on the Dark Web</dc:title>
			<dc:creator>Jose-Amelio Medina-Merodio</dc:creator>
			<dc:creator>Mikel Ferrer-Oliva</dc:creator>
			<dc:creator>José Fernández López</dc:creator>
			<dc:creator>Alejandro Ruiz-Zambrano</dc:creator>
			<dc:creator>Adrián Domínguez-Díaz</dc:creator>
		<dc:identifier>doi: 10.3390/info17050469</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>469</prism:startingPage>
		<prism:doi>10.3390/info17050469</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/469</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/468">

	<title>Information, Vol. 17, Pages 468: A Lightweight Robotic Process Automation Framework for Financial Analytics in Spreadsheet-Centric SMEs</title>
	<link>https://www.mdpi.com/2078-2489/17/5/468</link>
	<description>Small and medium-sized enterprises (SMEs) frequently depend on spreadsheet-based financial reporting due to limited budgets and constrained access to enterprise analytics systems. As transaction volumes increase, manual profit and loss computation becomes time-intensive and prone to inconsistencies. This study proposes and evaluates a modular robotic process automation (RPA) framework designed to enhance spreadsheet-centric financial analytics without requiring enterprise system replacement. The framework is implemented as a unified pipeline using UiPath. Statistical anomaly detection mechanisms are integrated to identify abnormal revenue deviations and expense spikes in operational data. Experimental benchmarking compares manual spreadsheet processing with automated workflow execution using execution time, error exposure, reporting latency, and scalability as evaluation criteria. Empirical evaluation across five datasets spanning 300 to 3000 transactions demonstrates time reductions of 88.6% to 95.5% and error reductions of 93.3% to 95.5% relative to manual spreadsheet processing. Scalability analysis confirms linear growth of automated runtime with transaction volume, in contrast to the superlinear growth observed in manual processing. A cost feasibility analysis further indicates that lightweight RPA can significantly reduce operational costs in SME environments up to 88.6%. The study contributes a structured automation architecture that integrates spreadsheet automation with statistical monitoring to support financial oversight and decision support. The findings suggest that interface-level automation provides a viable transitional pathway for SMEs seeking incremental digital transformation while preserving existing spreadsheet infrastructures.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 468: A Lightweight Robotic Process Automation Framework for Financial Analytics in Spreadsheet-Centric SMEs</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/468">doi: 10.3390/info17050468</a></p>
	<p>Authors:
		Sumukhi Nandam
		Carlos D. Paternina-Arboleda
		</p>
	<p>Small and medium-sized enterprises (SMEs) frequently depend on spreadsheet-based financial reporting due to limited budgets and constrained access to enterprise analytics systems. As transaction volumes increase, manual profit and loss computation becomes time-intensive and prone to inconsistencies. This study proposes and evaluates a modular robotic process automation (RPA) framework designed to enhance spreadsheet-centric financial analytics without requiring enterprise system replacement. The framework is implemented as a unified pipeline using UiPath. Statistical anomaly detection mechanisms are integrated to identify abnormal revenue deviations and expense spikes in operational data. Experimental benchmarking compares manual spreadsheet processing with automated workflow execution using execution time, error exposure, reporting latency, and scalability as evaluation criteria. Empirical evaluation across five datasets spanning 300 to 3000 transactions demonstrates time reductions of 88.6% to 95.5% and error reductions of 93.3% to 95.5% relative to manual spreadsheet processing. Scalability analysis confirms linear growth of automated runtime with transaction volume, in contrast to the superlinear growth observed in manual processing. A cost feasibility analysis further indicates that lightweight RPA can significantly reduce operational costs in SME environments up to 88.6%. The study contributes a structured automation architecture that integrates spreadsheet automation with statistical monitoring to support financial oversight and decision support. The findings suggest that interface-level automation provides a viable transitional pathway for SMEs seeking incremental digital transformation while preserving existing spreadsheet infrastructures.</p>
	]]></content:encoded>

	<dc:title>A Lightweight Robotic Process Automation Framework for Financial Analytics in Spreadsheet-Centric SMEs</dc:title>
			<dc:creator>Sumukhi Nandam</dc:creator>
			<dc:creator>Carlos D. Paternina-Arboleda</dc:creator>
		<dc:identifier>doi: 10.3390/info17050468</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>468</prism:startingPage>
		<prism:doi>10.3390/info17050468</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/468</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/467">

	<title>Information, Vol. 17, Pages 467: Drug&amp;ndash;Drug Interaction Prediction Using SMOTE and Gray Wolf Optimizer: Comparative Analysis of Machine Learning and Deep Learning Models</title>
	<link>https://www.mdpi.com/2078-2489/17/5/467</link>
	<description>Drug&amp;amp;ndash;drug interaction (DDI) prediction plays a critical role in optimizing therapeutic outcomes and enhancing patient safety. DDIs pose challenges in drug discovery, often leading to adverse effects, reduced efficacy, or unexpected outcomes. AI in DDIs acts as an effective tool for analyzing and predicting DDIs which introduced efficient computational approaches to DDI prediction. This paper aims to provide a comprehensive understanding of how ML and DL models perform in DDI prediction. This paper presents a comparative analysis based on key performance metrics such as accuracy, precision, recall and F-score for different ML and DL Models. We used Synthetic Minority Oversampling Technique (SMOTE) and the Gray Wolf Optimizer (GWO) which achieved the best accuracy of 95.42%. Combining the GWO with SMOTE addresses both optimization and data imbalance challenges in DDI prediction. Effectively, SMOTE addresses the class imbalance issue that leads to poor performance. SMOTE improves model performance by generating synthetic examples of the minority class rather than merely duplicating existing ones. This helps create a balanced dataset, enabling the model to learn the decision boundaries more accurately. SMOTE reduces the risk of overfitting. The GWO serves as a metaheuristic optimization framework that enhances model performance by guiding optimal feature selection subsets. This optimization process improves the model&amp;amp;rsquo;s ability to capture complex, non-linear interaction patterns, leading to enhanced results. In our result, we achieve an accuracy of over 94% which helps in drug safety and therapeutic decision-making in health informatics.</description>
	<pubDate>2026-05-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 467: Drug&amp;ndash;Drug Interaction Prediction Using SMOTE and Gray Wolf Optimizer: Comparative Analysis of Machine Learning and Deep Learning Models</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/467">doi: 10.3390/info17050467</a></p>
	<p>Authors:
		Basma Elsharkawy
		Amira Abdelatey
		O. G. El Barbary
		Hatem Abdelkader
		Nesma Mahmoud
		</p>
	<p>Drug&amp;amp;ndash;drug interaction (DDI) prediction plays a critical role in optimizing therapeutic outcomes and enhancing patient safety. DDIs pose challenges in drug discovery, often leading to adverse effects, reduced efficacy, or unexpected outcomes. AI in DDIs acts as an effective tool for analyzing and predicting DDIs which introduced efficient computational approaches to DDI prediction. This paper aims to provide a comprehensive understanding of how ML and DL models perform in DDI prediction. This paper presents a comparative analysis based on key performance metrics such as accuracy, precision, recall and F-score for different ML and DL Models. We used Synthetic Minority Oversampling Technique (SMOTE) and the Gray Wolf Optimizer (GWO) which achieved the best accuracy of 95.42%. Combining the GWO with SMOTE addresses both optimization and data imbalance challenges in DDI prediction. Effectively, SMOTE addresses the class imbalance issue that leads to poor performance. SMOTE improves model performance by generating synthetic examples of the minority class rather than merely duplicating existing ones. This helps create a balanced dataset, enabling the model to learn the decision boundaries more accurately. SMOTE reduces the risk of overfitting. The GWO serves as a metaheuristic optimization framework that enhances model performance by guiding optimal feature selection subsets. This optimization process improves the model&amp;amp;rsquo;s ability to capture complex, non-linear interaction patterns, leading to enhanced results. In our result, we achieve an accuracy of over 94% which helps in drug safety and therapeutic decision-making in health informatics.</p>
	]]></content:encoded>

	<dc:title>Drug&amp;amp;ndash;Drug Interaction Prediction Using SMOTE and Gray Wolf Optimizer: Comparative Analysis of Machine Learning and Deep Learning Models</dc:title>
			<dc:creator>Basma Elsharkawy</dc:creator>
			<dc:creator>Amira Abdelatey</dc:creator>
			<dc:creator>O. G. El Barbary</dc:creator>
			<dc:creator>Hatem Abdelkader</dc:creator>
			<dc:creator>Nesma Mahmoud</dc:creator>
		<dc:identifier>doi: 10.3390/info17050467</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>467</prism:startingPage>
		<prism:doi>10.3390/info17050467</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/467</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/466">

	<title>Information, Vol. 17, Pages 466: Analyzing Train Delay Impacts on Subway Stations via a Three-Stage Approach: An Empirical Study on Shanghai and Shenzhen Metro Systems</title>
	<link>https://www.mdpi.com/2078-2489/17/5/466</link>
	<description>Transit delays can adversely affect passengers, operational efficiency, and daily lives. It is important to develop effective methods to identify and analyze train stations vulnerable to delays. This paper proposes a three-stage analytical framework for analyzing train station delays. In the first stage, the 3-sigma rule defines normal passenger volume ranges and establishes a time window affected by delays. Next, a multivariate time series clustering method identifies stations with stable demand and high volume, considering passenger volume differences both among and within stations. In the final stage, the effects of delays on these key stations are assessed by examining starting, duration, and ending times, and passenger volume variation, providing a comprehensive analysis of delay impact. The proposed framework is illustrated using two real-world incidents: the 2021 delay incident at Longyang Road Station of Shanghai Metro and the 2019 delay incident on the Taoyuan&amp;amp;ndash;Luohu section of Shenzhen Metro. Case studies revealed that affected stations are not limited to the specific line or direction of the delay, but also include opposite-direction and transfer stations. Station impacts exhibit phased onset and recovery patterns. Additionally, both increases and decreases in passenger volumes due to the delay present considerable implications. While both incidents exhibit common propagation and recovery patterns, the Shanghai incident displays wider passenger impacts and longer recovery periods, whereas the Shenzhen incident exhibits narrower impacts and faster recovery. Our results will aid transit managers in better managing delays, thereby improving passenger satisfaction and operational efficiency. This paper also offers an integrated station-level analytical framework and initial cross-case empirical evidence, while broader validation remains needed.</description>
	<pubDate>2026-05-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 466: Analyzing Train Delay Impacts on Subway Stations via a Three-Stage Approach: An Empirical Study on Shanghai and Shenzhen Metro Systems</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/466">doi: 10.3390/info17050466</a></p>
	<p>Authors:
		Jingjing Chen
		Xu Cheng
		Yuxin He
		Qi Zhang
		Xiaoling Liu
		Qin Luo
		Kwok-Leung Tsui
		</p>
	<p>Transit delays can adversely affect passengers, operational efficiency, and daily lives. It is important to develop effective methods to identify and analyze train stations vulnerable to delays. This paper proposes a three-stage analytical framework for analyzing train station delays. In the first stage, the 3-sigma rule defines normal passenger volume ranges and establishes a time window affected by delays. Next, a multivariate time series clustering method identifies stations with stable demand and high volume, considering passenger volume differences both among and within stations. In the final stage, the effects of delays on these key stations are assessed by examining starting, duration, and ending times, and passenger volume variation, providing a comprehensive analysis of delay impact. The proposed framework is illustrated using two real-world incidents: the 2021 delay incident at Longyang Road Station of Shanghai Metro and the 2019 delay incident on the Taoyuan&amp;amp;ndash;Luohu section of Shenzhen Metro. Case studies revealed that affected stations are not limited to the specific line or direction of the delay, but also include opposite-direction and transfer stations. Station impacts exhibit phased onset and recovery patterns. Additionally, both increases and decreases in passenger volumes due to the delay present considerable implications. While both incidents exhibit common propagation and recovery patterns, the Shanghai incident displays wider passenger impacts and longer recovery periods, whereas the Shenzhen incident exhibits narrower impacts and faster recovery. Our results will aid transit managers in better managing delays, thereby improving passenger satisfaction and operational efficiency. This paper also offers an integrated station-level analytical framework and initial cross-case empirical evidence, while broader validation remains needed.</p>
	]]></content:encoded>

	<dc:title>Analyzing Train Delay Impacts on Subway Stations via a Three-Stage Approach: An Empirical Study on Shanghai and Shenzhen Metro Systems</dc:title>
			<dc:creator>Jingjing Chen</dc:creator>
			<dc:creator>Xu Cheng</dc:creator>
			<dc:creator>Yuxin He</dc:creator>
			<dc:creator>Qi Zhang</dc:creator>
			<dc:creator>Xiaoling Liu</dc:creator>
			<dc:creator>Qin Luo</dc:creator>
			<dc:creator>Kwok-Leung Tsui</dc:creator>
		<dc:identifier>doi: 10.3390/info17050466</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>466</prism:startingPage>
		<prism:doi>10.3390/info17050466</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/466</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/465">

	<title>Information, Vol. 17, Pages 465: An Attention-Enhanced Deep Learning Framework for Multi-Label Dental Findings Classification from Panoramic Radiographs</title>
	<link>https://www.mdpi.com/2078-2489/17/5/465</link>
	<description>Panoramic radiographs are widely used in dental practice due to their ability to provide a comprehensive view of the teeth, jaws, and surrounding anatomical structures in a single examination. However, automated interpretation remains challenging because multiple conditions may co-exist within a single image, class distributions are highly imbalanced, and several findings exhibit subtle radiographic characteristics. This study presents a deep learning framework for multi-label dental findings classification using panoramic radiographs from the publicly available VZRAD2 dataset. Following a label curation process, eleven clinically relevant classes were retained, including diseases, treatments, and anatomical structures. The proposed EfficientNet-B4-CBAM model integrates an EfficientNet-B4 backbone with a Convolutional Block Attention Module (CBAM) to enhance feature representation through channel and spatial attention. EfficientNet-B4 and ResNet50 were used as baseline models for comparison under a unified training protocol. The training pipeline incorporates data augmentation, weighted sampling to address class imbalance, AdamW optimization, and Binary Cross-Entropy with Logits loss for multi-label learning. On the validation set, the proposed model achieved the highest micro-F1 score of 0.8567, compared to 0.8424 for EfficientNet-B4 and 0.8469 for ResNet50. ROC analysis showed comparable separability across models, with micro-AUC values of 0.946 (EfficientNet-B4-CBAM), 0.947 (EfficientNet-B4), and 0.960 (ResNet50). Class-wise evaluation indicated strong performance for visually distinct findings such as impacted tooth, implant, filling, and root canal treatment, while anatomically diffuse or underrepresented classes remained more challenging. Grad-CAM visualizations suggest that the model focuses on clinically relevant regions, supporting interpretability. Overall, the results indicate that attention-enhanced convolutional models can provide effective and interpretable support for multi-label dental findings classification. However, the observed performance improvements are modest, and further validation on independent datasets, along with clinical evaluation, is required to confirm generalizability and real-world applicability.</description>
	<pubDate>2026-05-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 465: An Attention-Enhanced Deep Learning Framework for Multi-Label Dental Findings Classification from Panoramic Radiographs</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/465">doi: 10.3390/info17050465</a></p>
	<p>Authors:
		Mona Almutairi
		Samia Dardouri
		</p>
	<p>Panoramic radiographs are widely used in dental practice due to their ability to provide a comprehensive view of the teeth, jaws, and surrounding anatomical structures in a single examination. However, automated interpretation remains challenging because multiple conditions may co-exist within a single image, class distributions are highly imbalanced, and several findings exhibit subtle radiographic characteristics. This study presents a deep learning framework for multi-label dental findings classification using panoramic radiographs from the publicly available VZRAD2 dataset. Following a label curation process, eleven clinically relevant classes were retained, including diseases, treatments, and anatomical structures. The proposed EfficientNet-B4-CBAM model integrates an EfficientNet-B4 backbone with a Convolutional Block Attention Module (CBAM) to enhance feature representation through channel and spatial attention. EfficientNet-B4 and ResNet50 were used as baseline models for comparison under a unified training protocol. The training pipeline incorporates data augmentation, weighted sampling to address class imbalance, AdamW optimization, and Binary Cross-Entropy with Logits loss for multi-label learning. On the validation set, the proposed model achieved the highest micro-F1 score of 0.8567, compared to 0.8424 for EfficientNet-B4 and 0.8469 for ResNet50. ROC analysis showed comparable separability across models, with micro-AUC values of 0.946 (EfficientNet-B4-CBAM), 0.947 (EfficientNet-B4), and 0.960 (ResNet50). Class-wise evaluation indicated strong performance for visually distinct findings such as impacted tooth, implant, filling, and root canal treatment, while anatomically diffuse or underrepresented classes remained more challenging. Grad-CAM visualizations suggest that the model focuses on clinically relevant regions, supporting interpretability. Overall, the results indicate that attention-enhanced convolutional models can provide effective and interpretable support for multi-label dental findings classification. However, the observed performance improvements are modest, and further validation on independent datasets, along with clinical evaluation, is required to confirm generalizability and real-world applicability.</p>
	]]></content:encoded>

	<dc:title>An Attention-Enhanced Deep Learning Framework for Multi-Label Dental Findings Classification from Panoramic Radiographs</dc:title>
			<dc:creator>Mona Almutairi</dc:creator>
			<dc:creator>Samia Dardouri</dc:creator>
		<dc:identifier>doi: 10.3390/info17050465</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>465</prism:startingPage>
		<prism:doi>10.3390/info17050465</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/465</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/464">

	<title>Information, Vol. 17, Pages 464: Machine Learning-Based Optimization of Fine Aggregate Packing and Shape Characteristics for Cement Reduction in Concrete Mixtures</title>
	<link>https://www.mdpi.com/2078-2489/17/5/464</link>
	<description>Reducing cement consumption in mortar systems is essential for lowering the environmental impact of cement-based materials. Conventional mix design approaches rely mainly on particle size distribution and fineness modulus, which do not fully capture the effects of aggregate packing, morphology, and petrographic composition on paste demand and mechanical performance. Fourteen fine aggregates of distinct geological origins were experimentally characterized in terms of physical and petrographic properties. A dataset of 211 mortar mixtures, yielding 633 transverse-strength observations, was used to train a Random Forest Regressor (RFR) model for strength prediction. The model achieved R2=0.762 (RMSE = 0.223 kN; MAE = 0.165 kN), demonstrating its reliability as a surrogate screening tool. This study presents a hybrid framework that integrates particle packing theory with machine learning to optimize fine aggregate blends. By introducing a Paste Demand Index (PDI)&amp;amp;mdash;combining normalized uncompacted void content, surface texture, and shape&amp;amp;mdash;the framework enables the identification of mixtures that minimize paste demand while maintaining mechanical performance under strength constraints. Results confirm that the proposed PDI and strength-based filtering are robust, offering a physically grounded decision-support methodology for narrowing the design space. Ultimately, this approach provides an efficient strategy for resource optimization, effectively bridging the gap between computational screening and laboratory validation in cement-reduction initiatives driven by the cement-based tile manufacturing industry.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 464: Machine Learning-Based Optimization of Fine Aggregate Packing and Shape Characteristics for Cement Reduction in Concrete Mixtures</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/464">doi: 10.3390/info17050464</a></p>
	<p>Authors:
		Jorge Fernando Sosa Gallardo
		Vivian Felix López Batista
		María N. Moreno-García
		María Dolores Muñoz Vicente
		Aldo Fernand Sosa Gallardo
		</p>
	<p>Reducing cement consumption in mortar systems is essential for lowering the environmental impact of cement-based materials. Conventional mix design approaches rely mainly on particle size distribution and fineness modulus, which do not fully capture the effects of aggregate packing, morphology, and petrographic composition on paste demand and mechanical performance. Fourteen fine aggregates of distinct geological origins were experimentally characterized in terms of physical and petrographic properties. A dataset of 211 mortar mixtures, yielding 633 transverse-strength observations, was used to train a Random Forest Regressor (RFR) model for strength prediction. The model achieved R2=0.762 (RMSE = 0.223 kN; MAE = 0.165 kN), demonstrating its reliability as a surrogate screening tool. This study presents a hybrid framework that integrates particle packing theory with machine learning to optimize fine aggregate blends. By introducing a Paste Demand Index (PDI)&amp;amp;mdash;combining normalized uncompacted void content, surface texture, and shape&amp;amp;mdash;the framework enables the identification of mixtures that minimize paste demand while maintaining mechanical performance under strength constraints. Results confirm that the proposed PDI and strength-based filtering are robust, offering a physically grounded decision-support methodology for narrowing the design space. Ultimately, this approach provides an efficient strategy for resource optimization, effectively bridging the gap between computational screening and laboratory validation in cement-reduction initiatives driven by the cement-based tile manufacturing industry.</p>
	]]></content:encoded>

	<dc:title>Machine Learning-Based Optimization of Fine Aggregate Packing and Shape Characteristics for Cement Reduction in Concrete Mixtures</dc:title>
			<dc:creator>Jorge Fernando Sosa Gallardo</dc:creator>
			<dc:creator>Vivian Felix López Batista</dc:creator>
			<dc:creator>María N. Moreno-García</dc:creator>
			<dc:creator>María Dolores Muñoz Vicente</dc:creator>
			<dc:creator>Aldo Fernand Sosa Gallardo</dc:creator>
		<dc:identifier>doi: 10.3390/info17050464</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>464</prism:startingPage>
		<prism:doi>10.3390/info17050464</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/464</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/463">

	<title>Information, Vol. 17, Pages 463: Automating Systematic Reviews in Clinical Psychiatry: Comparing Domain Experts and NLP-Based Text Mining</title>
	<link>https://www.mdpi.com/2078-2489/17/5/463</link>
	<description>Objective: This study examines the potential of natural language processing and text mining to automate the systematic review process in clinical psychiatry, a field that traditionally relies on domain experts and can be time-consuming, prone to human bias and errors. The study compares the classification of review articles by domain experts with that facilitated by machine algorithms. Methods: Using data from PubMed, 160 abstracts related to &amp;amp;ldquo;transcranial magnetic stimulation&amp;amp;rdquo; and &amp;amp;ldquo;autism&amp;amp;rdquo; were classified into &amp;amp;ldquo;treatment&amp;amp;rdquo; and &amp;amp;ldquo;non-treatment&amp;amp;rdquo; categories by both human reviewers and a computer algorithm. The computer algorithm, employing topic modeling in text mining, was compared to human reviewers, including two psychiatrists, a biostatistician, and a medical student. Results: The accuracy of human classifications ranged from 68% to 85%, with inter-rater reliability (Kappa statistic) between 0.40 (fair to moderate) and 0.64 (substantial). Intra-rater reliability, tested by reclassification after three months, varied from 0.38 to 0.82. Conclusions: The findings highlight the consistency and reproducibility of computational approaches compared to human classification, which exhibited both inter-rater and intra-rater variability. Differences in reviewer performance were observed; however, these patterns should be interpreted cautiously, as the study was not designed to directly assess cognitive or decision-making processes.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 463: Automating Systematic Reviews in Clinical Psychiatry: Comparing Domain Experts and NLP-Based Text Mining</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/463">doi: 10.3390/info17050463</a></p>
	<p>Authors:
		Cyril S. Ku
		Daniel Weiner
		Meera Wells
		Andrew Huang
		Morgan R. Peltier
		</p>
	<p>Objective: This study examines the potential of natural language processing and text mining to automate the systematic review process in clinical psychiatry, a field that traditionally relies on domain experts and can be time-consuming, prone to human bias and errors. The study compares the classification of review articles by domain experts with that facilitated by machine algorithms. Methods: Using data from PubMed, 160 abstracts related to &amp;amp;ldquo;transcranial magnetic stimulation&amp;amp;rdquo; and &amp;amp;ldquo;autism&amp;amp;rdquo; were classified into &amp;amp;ldquo;treatment&amp;amp;rdquo; and &amp;amp;ldquo;non-treatment&amp;amp;rdquo; categories by both human reviewers and a computer algorithm. The computer algorithm, employing topic modeling in text mining, was compared to human reviewers, including two psychiatrists, a biostatistician, and a medical student. Results: The accuracy of human classifications ranged from 68% to 85%, with inter-rater reliability (Kappa statistic) between 0.40 (fair to moderate) and 0.64 (substantial). Intra-rater reliability, tested by reclassification after three months, varied from 0.38 to 0.82. Conclusions: The findings highlight the consistency and reproducibility of computational approaches compared to human classification, which exhibited both inter-rater and intra-rater variability. Differences in reviewer performance were observed; however, these patterns should be interpreted cautiously, as the study was not designed to directly assess cognitive or decision-making processes.</p>
	]]></content:encoded>

	<dc:title>Automating Systematic Reviews in Clinical Psychiatry: Comparing Domain Experts and NLP-Based Text Mining</dc:title>
			<dc:creator>Cyril S. Ku</dc:creator>
			<dc:creator>Daniel Weiner</dc:creator>
			<dc:creator>Meera Wells</dc:creator>
			<dc:creator>Andrew Huang</dc:creator>
			<dc:creator>Morgan R. Peltier</dc:creator>
		<dc:identifier>doi: 10.3390/info17050463</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>463</prism:startingPage>
		<prism:doi>10.3390/info17050463</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/463</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/462">

	<title>Information, Vol. 17, Pages 462: Harnessing ERP Implementation to Drive Operational Performance: The Roles of Technological Factors and Top Management Support</title>
	<link>https://www.mdpi.com/2078-2489/17/5/462</link>
	<description>This study proposes an integrative model that combines technological factors and top management support to examine their impact on successful ERP implementation and its direct effect on the efficiency, effectiveness, and flexibility of business processes in the context of firms operating in Serbia. Employing the Technology&amp;amp;ndash;Organization&amp;amp;ndash;Environment (TOE) framework, this research analyzes data collected from 123 managers using a structured questionnaire and Partial Least Squares Structural Equation Modeling (PLS-SEM). The findings reveal that technological complexity positively affects ERP implementation success, contrary to common assumptions that complexity is a barrier. Technological compatibility and readiness show no direct significant effects but demonstrate conditional influences when moderated by top management support. Top management involvement significantly moderates the relationship between technological factors and ERP success, with balanced managerial engagement being critical to avoid potential negative impacts of over-control in complex projects. Moreover, ERP implementation significantly enhances operational efficiency, effectiveness, and flexibility. This study concludes that ERP success depends on the interplay between technological attributes and well-balanced leadership support, emphasizing the need for holistic management of technology, people, and processes. These insights contribute to theoretical understanding and practical guidance for organizations aiming to optimize ERP outcomes and operational performance.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 462: Harnessing ERP Implementation to Drive Operational Performance: The Roles of Technological Factors and Top Management Support</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/462">doi: 10.3390/info17050462</a></p>
	<p>Authors:
		Igor Milojevic
		Dragana Rejman Petrovic
		Marina Milanovic
		Bojan Lekovic
		Marko Slavkovic
		</p>
	<p>This study proposes an integrative model that combines technological factors and top management support to examine their impact on successful ERP implementation and its direct effect on the efficiency, effectiveness, and flexibility of business processes in the context of firms operating in Serbia. Employing the Technology&amp;amp;ndash;Organization&amp;amp;ndash;Environment (TOE) framework, this research analyzes data collected from 123 managers using a structured questionnaire and Partial Least Squares Structural Equation Modeling (PLS-SEM). The findings reveal that technological complexity positively affects ERP implementation success, contrary to common assumptions that complexity is a barrier. Technological compatibility and readiness show no direct significant effects but demonstrate conditional influences when moderated by top management support. Top management involvement significantly moderates the relationship between technological factors and ERP success, with balanced managerial engagement being critical to avoid potential negative impacts of over-control in complex projects. Moreover, ERP implementation significantly enhances operational efficiency, effectiveness, and flexibility. This study concludes that ERP success depends on the interplay between technological attributes and well-balanced leadership support, emphasizing the need for holistic management of technology, people, and processes. These insights contribute to theoretical understanding and practical guidance for organizations aiming to optimize ERP outcomes and operational performance.</p>
	]]></content:encoded>

	<dc:title>Harnessing ERP Implementation to Drive Operational Performance: The Roles of Technological Factors and Top Management Support</dc:title>
			<dc:creator>Igor Milojevic</dc:creator>
			<dc:creator>Dragana Rejman Petrovic</dc:creator>
			<dc:creator>Marina Milanovic</dc:creator>
			<dc:creator>Bojan Lekovic</dc:creator>
			<dc:creator>Marko Slavkovic</dc:creator>
		<dc:identifier>doi: 10.3390/info17050462</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>462</prism:startingPage>
		<prism:doi>10.3390/info17050462</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/462</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/459">

	<title>Information, Vol. 17, Pages 459: Socioeconomic Covariate-Dependent Bayesian Nonparametric Mixture Model for Household Spending Patterns to Identify Multidimensional Vulnerability</title>
	<link>https://www.mdpi.com/2078-2489/17/5/459</link>
	<description>Household vulnerability assessment in Malaysia has traditionally relied on income-based indicators, which do not adequately capture multidimensional deprivation. To address this limitation, this study employs Random Tree&amp;amp;ndash;Dirichlet Process Mixture Model (RT-DPMM) to identify latent heterogeneity in spending patterns and their associated socioeconomic characteristics. Using microdata from Household Expenditure Survey (HES), this study performs clustering on 5130 stable household head samples with nine spending proportional features to model their joint distribution as mixtures of Dirichlet distributions, while five socioeconomic covariates inform cluster allocation through Random Tree embeddings. The proposed RT-DPMM identifies four distinct spending clusters: Balanced Budget Households (Cluster 1, N = 2883), Mobility and Home-Support Households (Cluster 2, N = 642), Basic Essentials-Focused Households (Cluster 3, N = 977), and Luxury Households (Cluster 4, N = 628). Cluster 1 and 3 are characterized as relatively vulnerable groups. These clusters have lower income levels and allocate a larger budget share in Food and Beverages, consistent with the Engel Law&amp;amp;rsquo;s interpretation of higher food percentage in lower income households. Cluster 1 households primarily allocate their budget evenly across essential and non-essential spending. Cluster 3 are mostly elderly household heads with the highest budget shares in essential spending. In contrast, Cluster 2 and 4 appear relatively better off financially, given their higher income and larger spending share to non-essential categories. These findings suggest that social assistance policies should target expenditure patterns, rather than relying solely on income-based targeting.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 459: Socioeconomic Covariate-Dependent Bayesian Nonparametric Mixture Model for Household Spending Patterns to Identify Multidimensional Vulnerability</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/459">doi: 10.3390/info17050459</a></p>
	<p>Authors:
		En Lee
		Thian Song Ong
		Yvonne Lee
		</p>
	<p>Household vulnerability assessment in Malaysia has traditionally relied on income-based indicators, which do not adequately capture multidimensional deprivation. To address this limitation, this study employs Random Tree&amp;amp;ndash;Dirichlet Process Mixture Model (RT-DPMM) to identify latent heterogeneity in spending patterns and their associated socioeconomic characteristics. Using microdata from Household Expenditure Survey (HES), this study performs clustering on 5130 stable household head samples with nine spending proportional features to model their joint distribution as mixtures of Dirichlet distributions, while five socioeconomic covariates inform cluster allocation through Random Tree embeddings. The proposed RT-DPMM identifies four distinct spending clusters: Balanced Budget Households (Cluster 1, N = 2883), Mobility and Home-Support Households (Cluster 2, N = 642), Basic Essentials-Focused Households (Cluster 3, N = 977), and Luxury Households (Cluster 4, N = 628). Cluster 1 and 3 are characterized as relatively vulnerable groups. These clusters have lower income levels and allocate a larger budget share in Food and Beverages, consistent with the Engel Law&amp;amp;rsquo;s interpretation of higher food percentage in lower income households. Cluster 1 households primarily allocate their budget evenly across essential and non-essential spending. Cluster 3 are mostly elderly household heads with the highest budget shares in essential spending. In contrast, Cluster 2 and 4 appear relatively better off financially, given their higher income and larger spending share to non-essential categories. These findings suggest that social assistance policies should target expenditure patterns, rather than relying solely on income-based targeting.</p>
	]]></content:encoded>

	<dc:title>Socioeconomic Covariate-Dependent Bayesian Nonparametric Mixture Model for Household Spending Patterns to Identify Multidimensional Vulnerability</dc:title>
			<dc:creator>En Lee</dc:creator>
			<dc:creator>Thian Song Ong</dc:creator>
			<dc:creator>Yvonne Lee</dc:creator>
		<dc:identifier>doi: 10.3390/info17050459</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>459</prism:startingPage>
		<prism:doi>10.3390/info17050459</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/459</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/461">

	<title>Information, Vol. 17, Pages 461: Early Mild Cognitive Impairment Diagnosis via Resting-State fMRI Brain Networks Using a Region-Specific Hierarchical Fusion Graph Neural Network</title>
	<link>https://www.mdpi.com/2078-2489/17/5/461</link>
	<description>Early mild cognitive impairment (EMCI) is the earliest intervenable stage of Alzheimer&amp;amp;rsquo;s disease (AD). Although graph neural networks (GNNs) have begun to exploit brain network topology, traditional fMRI-based diagnostic methods often neglect these structural patterns by relying on vectorized features. Furthermore, existing GNNs frequently disregard inter-regional functional heterogeneity and group-level discriminative patterns, leading to limited accuracy and biomarker interpretability. To address these challenges, we propose HF-BrainGNN, an end-to-end hierarchical graph learning framework for EMCI identification. Our method introduces a functional affinity region convolution (FAR-Conv) layer to learn region-adaptive kernels, a Differential Focus Pooling (DF-Pool) module to identify disease-salient brain regions by maximizing inter-group distinctiveness, and a hierarchical integration classifier (HIC) to fuse multi-level graph representations. The framework is optimized using classification, focus separation, and consistency regularization losses. Experiments on the ADNI dataset (104 EMCI, 114 Cognitively Normal) show that HF-BrainGNN achieves 86.78% accuracy, outperforming the best baseline (Hi-GCN) by 4.64%. Furthermore, the automatically identified regions, such as the bilateral hippocampus and default mode network hubs, align with established EMCI biomarkers. Ultimately, HF-BrainGNN provides an efficient, interpretable artificial intelligence tool for precise brain network characterization and early AD intervention.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 461: Early Mild Cognitive Impairment Diagnosis via Resting-State fMRI Brain Networks Using a Region-Specific Hierarchical Fusion Graph Neural Network</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/461">doi: 10.3390/info17050461</a></p>
	<p>Authors:
		Zhiang Chen
		Miao Song
		Ningge Wu
		</p>
	<p>Early mild cognitive impairment (EMCI) is the earliest intervenable stage of Alzheimer&amp;amp;rsquo;s disease (AD). Although graph neural networks (GNNs) have begun to exploit brain network topology, traditional fMRI-based diagnostic methods often neglect these structural patterns by relying on vectorized features. Furthermore, existing GNNs frequently disregard inter-regional functional heterogeneity and group-level discriminative patterns, leading to limited accuracy and biomarker interpretability. To address these challenges, we propose HF-BrainGNN, an end-to-end hierarchical graph learning framework for EMCI identification. Our method introduces a functional affinity region convolution (FAR-Conv) layer to learn region-adaptive kernels, a Differential Focus Pooling (DF-Pool) module to identify disease-salient brain regions by maximizing inter-group distinctiveness, and a hierarchical integration classifier (HIC) to fuse multi-level graph representations. The framework is optimized using classification, focus separation, and consistency regularization losses. Experiments on the ADNI dataset (104 EMCI, 114 Cognitively Normal) show that HF-BrainGNN achieves 86.78% accuracy, outperforming the best baseline (Hi-GCN) by 4.64%. Furthermore, the automatically identified regions, such as the bilateral hippocampus and default mode network hubs, align with established EMCI biomarkers. Ultimately, HF-BrainGNN provides an efficient, interpretable artificial intelligence tool for precise brain network characterization and early AD intervention.</p>
	]]></content:encoded>

	<dc:title>Early Mild Cognitive Impairment Diagnosis via Resting-State fMRI Brain Networks Using a Region-Specific Hierarchical Fusion Graph Neural Network</dc:title>
			<dc:creator>Zhiang Chen</dc:creator>
			<dc:creator>Miao Song</dc:creator>
			<dc:creator>Ningge Wu</dc:creator>
		<dc:identifier>doi: 10.3390/info17050461</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>461</prism:startingPage>
		<prism:doi>10.3390/info17050461</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/461</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/460">

	<title>Information, Vol. 17, Pages 460: Parameter-Efficient Fine-Tuning via General Linear Structural Regularization for High-Rank Adaptation</title>
	<link>https://www.mdpi.com/2078-2489/17/5/460</link>
	<description>Parameter-efficient fine-tuning (PEFT) enables large language models to adapt to downstream tasks with low computational cost. As a representative high-rank PEFT method, MoRA (High-Rank Updating for Parameter-Efficient Fine-Tuning) improves update expressiveness through a compression&amp;amp;ndash;transformation&amp;amp;ndash;decompression reparameterization mechanism. However, its bottleneck subspace is still modeled using a freely learned linear transformation. In addition, grouped compression may project information from different original directions into shared bottleneck coordinates. This may reduce subspace separability and lead to inefficient utilization of the effective update space. To address this limitation, we propose GL-log-MoRA, which introduces a learnable general linear transformation into the MoRA bottleneck subspace and applies log-determinant regularization to encourage a more balanced spectral structure. In this way, the proposed method improves directional coordination and subspace expressiveness without imposing hard structural constraints or causing noticeable memory overhead. We evaluate GL-log-MoRA on five benchmarks: LogiQA, Financial PhraseBank, GSM8K, FinQA, and HotpotQA. The results show that GL-log-MoRA achieves the best performance on these downstream tasks and yields small but consistent improvements over MoRA under the same parameter budget. Compared with MoRA, GL-log-MoRA improves LogiQA from 42.50% to 45.45% and Financial PhraseBank from 81.60% to 83.02%. It also improves GSM8K from 63.1% to 64.6%, FinQA from 10.02% to 10.23%, and HotpotQA from 70.6% to 70.8%. Meanwhile, the average empirical effective-rank indicator increases from 1.05 to 2.80. Peak GPU memory changes only slightly, from 18.21 GB to 18.28 GB.</description>
	<pubDate>2026-05-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 460: Parameter-Efficient Fine-Tuning via General Linear Structural Regularization for High-Rank Adaptation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/460">doi: 10.3390/info17050460</a></p>
	<p>Authors:
		Bo Zhao
		Weihua Ou
		</p>
	<p>Parameter-efficient fine-tuning (PEFT) enables large language models to adapt to downstream tasks with low computational cost. As a representative high-rank PEFT method, MoRA (High-Rank Updating for Parameter-Efficient Fine-Tuning) improves update expressiveness through a compression&amp;amp;ndash;transformation&amp;amp;ndash;decompression reparameterization mechanism. However, its bottleneck subspace is still modeled using a freely learned linear transformation. In addition, grouped compression may project information from different original directions into shared bottleneck coordinates. This may reduce subspace separability and lead to inefficient utilization of the effective update space. To address this limitation, we propose GL-log-MoRA, which introduces a learnable general linear transformation into the MoRA bottleneck subspace and applies log-determinant regularization to encourage a more balanced spectral structure. In this way, the proposed method improves directional coordination and subspace expressiveness without imposing hard structural constraints or causing noticeable memory overhead. We evaluate GL-log-MoRA on five benchmarks: LogiQA, Financial PhraseBank, GSM8K, FinQA, and HotpotQA. The results show that GL-log-MoRA achieves the best performance on these downstream tasks and yields small but consistent improvements over MoRA under the same parameter budget. Compared with MoRA, GL-log-MoRA improves LogiQA from 42.50% to 45.45% and Financial PhraseBank from 81.60% to 83.02%. It also improves GSM8K from 63.1% to 64.6%, FinQA from 10.02% to 10.23%, and HotpotQA from 70.6% to 70.8%. Meanwhile, the average empirical effective-rank indicator increases from 1.05 to 2.80. Peak GPU memory changes only slightly, from 18.21 GB to 18.28 GB.</p>
	]]></content:encoded>

	<dc:title>Parameter-Efficient Fine-Tuning via General Linear Structural Regularization for High-Rank Adaptation</dc:title>
			<dc:creator>Bo Zhao</dc:creator>
			<dc:creator>Weihua Ou</dc:creator>
		<dc:identifier>doi: 10.3390/info17050460</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>460</prism:startingPage>
		<prism:doi>10.3390/info17050460</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/460</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/458">

	<title>Information, Vol. 17, Pages 458: Multimodal Emotion Detection in Low-Resource Languages Using Lightweight Transformer Architectures: A Dual-Level Fusion Framework Integrating DistilBERT, CNN-BiGRU, and MobileViT for Efficient Real-Time Urdu Affective Computing</title>
	<link>https://www.mdpi.com/2078-2489/17/5/458</link>
	<description>This paper addresses emotion recognition in low-resource language settings for healthcare and human-computer interaction (HCI). Most existing multimodal systems rely on resource-intensive transformers or high-resource languages, limiting their applicability to low-resource languages like Urdu. We propose an efficiency-driven, lightweight multimodal framework for Urdu emotion detection integrating facial expressions, speech, and text. We utilize DistilBERT for text, CNN-BiGRU for audio, and MobileViT-XXS for visual processing with a dual-level fusion strategy. We evaluate on the publicly available UMED corpus, the only multimodal Urdu emotion dataset. Our system recognizes expressed emotional signals rather than internal affective states. Experimental results demonstrate competitive performance (83.72% accuracy) while requiring 76.5% fewer parameters and 4.4&amp;amp;times; faster inference than heavyweight baselines, enabling accessible, real-time emotion recognition in low-resource contexts.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 458: Multimodal Emotion Detection in Low-Resource Languages Using Lightweight Transformer Architectures: A Dual-Level Fusion Framework Integrating DistilBERT, CNN-BiGRU, and MobileViT for Efficient Real-Time Urdu Affective Computing</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/458">doi: 10.3390/info17050458</a></p>
	<p>Authors:
		Muhammad Azhar
		Adeen Amjad
		Muhammad Arman
		Deshinta Arrova Dewi
		</p>
	<p>This paper addresses emotion recognition in low-resource language settings for healthcare and human-computer interaction (HCI). Most existing multimodal systems rely on resource-intensive transformers or high-resource languages, limiting their applicability to low-resource languages like Urdu. We propose an efficiency-driven, lightweight multimodal framework for Urdu emotion detection integrating facial expressions, speech, and text. We utilize DistilBERT for text, CNN-BiGRU for audio, and MobileViT-XXS for visual processing with a dual-level fusion strategy. We evaluate on the publicly available UMED corpus, the only multimodal Urdu emotion dataset. Our system recognizes expressed emotional signals rather than internal affective states. Experimental results demonstrate competitive performance (83.72% accuracy) while requiring 76.5% fewer parameters and 4.4&amp;amp;times; faster inference than heavyweight baselines, enabling accessible, real-time emotion recognition in low-resource contexts.</p>
	]]></content:encoded>

	<dc:title>Multimodal Emotion Detection in Low-Resource Languages Using Lightweight Transformer Architectures: A Dual-Level Fusion Framework Integrating DistilBERT, CNN-BiGRU, and MobileViT for Efficient Real-Time Urdu Affective Computing</dc:title>
			<dc:creator>Muhammad Azhar</dc:creator>
			<dc:creator>Adeen Amjad</dc:creator>
			<dc:creator>Muhammad Arman</dc:creator>
			<dc:creator>Deshinta Arrova Dewi</dc:creator>
		<dc:identifier>doi: 10.3390/info17050458</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>458</prism:startingPage>
		<prism:doi>10.3390/info17050458</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/458</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/457">

	<title>Information, Vol. 17, Pages 457: Informative Path Planning for Autonomous Mapping of Unknown Non-Convex Environments: Design, Benchmarking, and Validation</title>
	<link>https://www.mdpi.com/2078-2489/17/5/457</link>
	<description>Rapid exploration of unknown environments is critical in engineering applications such as disaster response and autonomous inspection. This paper presents an informative path planning approach for autonomous mapping of fully unknown, non-convex environments using a mobile robot with an uncertain narrow-beam range sensor. The artificial intelligence contribution lies in approximating the global optimal exploration solution under uncertainty using a sequential decision-making algorithm. The engineering contribution is the formulation and introduction of a benchmark solution, and the validation of the proposed algorithm against this benchmark through simulation and real-world experiments. Results show that the method achieves approximately 70% of the benchmark efficiency, measured as map expansion per unit distance travelled, with near-linear map growth. Sensitivity analysis demonstrates robust performance under varying initial conditions, confirming its applicability for real-world autonomous robotic systems.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 457: Informative Path Planning for Autonomous Mapping of Unknown Non-Convex Environments: Design, Benchmarking, and Validation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/457">doi: 10.3390/info17050457</a></p>
	<p>Authors:
		Mobolaji Orisatoki
		Weihua Sheng
		Ebubekir Pinar
		Ali Rasoulzadeh
		Mahdi Amouzadi
		Arash M. Dizqah
		</p>
	<p>Rapid exploration of unknown environments is critical in engineering applications such as disaster response and autonomous inspection. This paper presents an informative path planning approach for autonomous mapping of fully unknown, non-convex environments using a mobile robot with an uncertain narrow-beam range sensor. The artificial intelligence contribution lies in approximating the global optimal exploration solution under uncertainty using a sequential decision-making algorithm. The engineering contribution is the formulation and introduction of a benchmark solution, and the validation of the proposed algorithm against this benchmark through simulation and real-world experiments. Results show that the method achieves approximately 70% of the benchmark efficiency, measured as map expansion per unit distance travelled, with near-linear map growth. Sensitivity analysis demonstrates robust performance under varying initial conditions, confirming its applicability for real-world autonomous robotic systems.</p>
	]]></content:encoded>

	<dc:title>Informative Path Planning for Autonomous Mapping of Unknown Non-Convex Environments: Design, Benchmarking, and Validation</dc:title>
			<dc:creator>Mobolaji Orisatoki</dc:creator>
			<dc:creator>Weihua Sheng</dc:creator>
			<dc:creator>Ebubekir Pinar</dc:creator>
			<dc:creator>Ali Rasoulzadeh</dc:creator>
			<dc:creator>Mahdi Amouzadi</dc:creator>
			<dc:creator>Arash M. Dizqah</dc:creator>
		<dc:identifier>doi: 10.3390/info17050457</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>457</prism:startingPage>
		<prism:doi>10.3390/info17050457</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/457</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/456">

	<title>Information, Vol. 17, Pages 456: Artificial Intelligence in Complex Manufacturing Systems: A Systematic Review of Validation Rigor and Deployment Readiness in Predictive Maintenance</title>
	<link>https://www.mdpi.com/2078-2489/17/5/456</link>
	<description>This systematic review (PRISMA 2020) examines 89 studies&amp;amp;mdash;64 peer-reviewed articles and 25 arXiv preprints (2007&amp;amp;ndash;2026)&amp;amp;mdash;addressing the gap between AI research and operational predictive maintenance (PdM) deployment in complex manufacturing systems. Analyzing five thematic clusters in non-stationary and stochastic environments, we evaluated predictive performance and deployment readiness. Deep learning dominates remaining useful life (RUL) forecasting; however, 65.6% of studies employ weak or unclear validation protocols (Tier 0&amp;amp;ndash;1), lacking real-world robustness testing. Fault diagnosis increasingly integrates Edge-AI, yet Explainable AI (XAI) adoption remains scarce (15.6%), undermining industrial trustworthiness. No study reached operational field validation beyond temporal or cross-domain split, reflecting a systematic disconnection from deployed manufacturing systems. We introduce a novel Deployment Readiness Score (DRS) framework and identify critical barriers: data scarcity, environmental non-stationarity, computational constraints, and black-box model distrust. Recommendations include standardized temporal validation protocols, multi-site field studies, and architecture-integrated explainability. The 25 arXiv preprints (2024&amp;amp;ndash;2026) exhibit a mean DRS nearly three times that of the peer-reviewed corpus, signaling nascent convergence toward deployment-mature research. This review was not pre-registered.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 456: Artificial Intelligence in Complex Manufacturing Systems: A Systematic Review of Validation Rigor and Deployment Readiness in Predictive Maintenance</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/456">doi: 10.3390/info17050456</a></p>
	<p>Authors:
		Cesar Felipe Henao Villa
		David Alberto Garcia Arango
		Luis Fernando Garcés Giraldo
		Rosana Alejandra Meleán Romero
		Alejandro Valencia-Arias
		José Alexander Velásquez Ochoa
		</p>
	<p>This systematic review (PRISMA 2020) examines 89 studies&amp;amp;mdash;64 peer-reviewed articles and 25 arXiv preprints (2007&amp;amp;ndash;2026)&amp;amp;mdash;addressing the gap between AI research and operational predictive maintenance (PdM) deployment in complex manufacturing systems. Analyzing five thematic clusters in non-stationary and stochastic environments, we evaluated predictive performance and deployment readiness. Deep learning dominates remaining useful life (RUL) forecasting; however, 65.6% of studies employ weak or unclear validation protocols (Tier 0&amp;amp;ndash;1), lacking real-world robustness testing. Fault diagnosis increasingly integrates Edge-AI, yet Explainable AI (XAI) adoption remains scarce (15.6%), undermining industrial trustworthiness. No study reached operational field validation beyond temporal or cross-domain split, reflecting a systematic disconnection from deployed manufacturing systems. We introduce a novel Deployment Readiness Score (DRS) framework and identify critical barriers: data scarcity, environmental non-stationarity, computational constraints, and black-box model distrust. Recommendations include standardized temporal validation protocols, multi-site field studies, and architecture-integrated explainability. The 25 arXiv preprints (2024&amp;amp;ndash;2026) exhibit a mean DRS nearly three times that of the peer-reviewed corpus, signaling nascent convergence toward deployment-mature research. This review was not pre-registered.</p>
	]]></content:encoded>

	<dc:title>Artificial Intelligence in Complex Manufacturing Systems: A Systematic Review of Validation Rigor and Deployment Readiness in Predictive Maintenance</dc:title>
			<dc:creator>Cesar Felipe Henao Villa</dc:creator>
			<dc:creator>David Alberto Garcia Arango</dc:creator>
			<dc:creator>Luis Fernando Garcés Giraldo</dc:creator>
			<dc:creator>Rosana Alejandra Meleán Romero</dc:creator>
			<dc:creator>Alejandro Valencia-Arias</dc:creator>
			<dc:creator>José Alexander Velásquez Ochoa</dc:creator>
		<dc:identifier>doi: 10.3390/info17050456</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Systematic Review</prism:section>
	<prism:startingPage>456</prism:startingPage>
		<prism:doi>10.3390/info17050456</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/456</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/455">

	<title>Information, Vol. 17, Pages 455: ACVM: An Adaptive Combination Validation Mechanism for Long-Tailed Image Recognition</title>
	<link>https://www.mdpi.com/2078-2489/17/5/455</link>
	<description>In real-world scenarios, large-scale datasets often exhibit a long-tailed data distribution. Training deep neural networks on such data typically leads to a bias towards head classes. Existing studies have demonstrated that the reweighting strategy is an effective means to alleviate the long-tailed issue. Recent studies suggest that incorporating class difficulty into reweighting can yield superior results. However, the method of quantifying class difficulty by an independent validation set has shown limitations in practical applications, i.e., wasting training samples and inaccurate estimations. To address this issue, this study proposes a novel model based on K-fold cross-validation, called the adaptive combination validation model, which contains two main innovations: first, both class and sample difficulty are quantified by using a more comprehensive and authentic estimation strategy, i.e., K-fold cross-validation, to obtain accurate and robust estimations; second, we extract the prediction probability distributions of samples, which reflect sample difficulty, from different model branches and design a distribution-harmonized loss to simultaneously focus on the effects of reweighted and original distributions. Extensive experiments on several popular long-tailed image recognition datasets (CIFAR10-LT and CIFAR100-LT, with several varying imbalance rates, and ImageNet-LT) demonstrate that the proposed method can effectively alleviate the long-tailed issue and achieve state-of-the-art performance on most datasets.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 455: ACVM: An Adaptive Combination Validation Mechanism for Long-Tailed Image Recognition</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/455">doi: 10.3390/info17050455</a></p>
	<p>Authors:
		Tianci Sun
		Wanqiu He
		Changbin Shao
		Shang Zheng
		Hualong Yu
		</p>
	<p>In real-world scenarios, large-scale datasets often exhibit a long-tailed data distribution. Training deep neural networks on such data typically leads to a bias towards head classes. Existing studies have demonstrated that the reweighting strategy is an effective means to alleviate the long-tailed issue. Recent studies suggest that incorporating class difficulty into reweighting can yield superior results. However, the method of quantifying class difficulty by an independent validation set has shown limitations in practical applications, i.e., wasting training samples and inaccurate estimations. To address this issue, this study proposes a novel model based on K-fold cross-validation, called the adaptive combination validation model, which contains two main innovations: first, both class and sample difficulty are quantified by using a more comprehensive and authentic estimation strategy, i.e., K-fold cross-validation, to obtain accurate and robust estimations; second, we extract the prediction probability distributions of samples, which reflect sample difficulty, from different model branches and design a distribution-harmonized loss to simultaneously focus on the effects of reweighted and original distributions. Extensive experiments on several popular long-tailed image recognition datasets (CIFAR10-LT and CIFAR100-LT, with several varying imbalance rates, and ImageNet-LT) demonstrate that the proposed method can effectively alleviate the long-tailed issue and achieve state-of-the-art performance on most datasets.</p>
	]]></content:encoded>

	<dc:title>ACVM: An Adaptive Combination Validation Mechanism for Long-Tailed Image Recognition</dc:title>
			<dc:creator>Tianci Sun</dc:creator>
			<dc:creator>Wanqiu He</dc:creator>
			<dc:creator>Changbin Shao</dc:creator>
			<dc:creator>Shang Zheng</dc:creator>
			<dc:creator>Hualong Yu</dc:creator>
		<dc:identifier>doi: 10.3390/info17050455</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>455</prism:startingPage>
		<prism:doi>10.3390/info17050455</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/455</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/454">

	<title>Information, Vol. 17, Pages 454: From Asymmetry to Equilibrium: How Government Regulation Drives Sustainable Digital Asset Management on Media Platforms in China</title>
	<link>https://www.mdpi.com/2078-2489/17/5/454</link>
	<description>The rapid digitalization of the media and publishing industry has deepened systemic asymmetries in resources, power, and institutional rights. These asymmetries create fundamental barriers to the economic&amp;amp;ndash;institutional sustainability of digital content dissemination. Existing governance frameworks have not yet comprehensively addressed the resulting competitive and informational imbalances. Adopting China&amp;amp;rsquo;s publishing and media industry as a focal case, this study draws on symmetry theory to develop an integrated analytical framework. It reconceptualizes government regulation as a multi-dimensional governance mechanism operating across three dimensions: resource allocation, technological innovation, and rights protection. We test this framework empirically using Xinbang Index data covering the top 10 publishing and media enterprises from 24 January 2025 to 7 December 2025. Multiple regression analysis and Spearman rank correlation are applied to assess each dimension&amp;amp;rsquo;s differential impact on content dissemination efficiency. The results yield four key findings. First, all three regulatory dimensions contribute positively to content dissemination efficiency. Second, technological innovation is the most potent symmetry-restoring lever, exerting a statistically robust direct effect on dissemination outcomes. Third, resource allocation provides a necessary foundational contribution, while rights protection operates conditionally&amp;amp;mdash;its effect is fully realized only alongside adequate technological and resource inputs. Fourth, an integrated multivariate regression confirms the cross-dimensional hierarchy: the standardized Beta coefficient for technological innovation (&amp;amp;beta; = 0.394) exceeds those for rights protection (&amp;amp;beta; = 0.294) and resource allocation (&amp;amp;beta; = 0.125). No single regulatory instrument is sufficient to achieve dynamic equilibrium. A synergistic, technology-centered combination of all three dimensions is required. This study proposes a tripartite symmetry-based governance strategy for media platform ecosystems. The symmetry framework developed here offers an analytical template for diagnosing analogous asymmetries in other platform-dependent sectors. Empirical validation beyond the Chinese publishing and media context is recommended as a priority for future research.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 454: From Asymmetry to Equilibrium: How Government Regulation Drives Sustainable Digital Asset Management on Media Platforms in China</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/454">doi: 10.3390/info17050454</a></p>
	<p>Authors:
		Shaozhen Hong
		Yingqi Liu
		</p>
	<p>The rapid digitalization of the media and publishing industry has deepened systemic asymmetries in resources, power, and institutional rights. These asymmetries create fundamental barriers to the economic&amp;amp;ndash;institutional sustainability of digital content dissemination. Existing governance frameworks have not yet comprehensively addressed the resulting competitive and informational imbalances. Adopting China&amp;amp;rsquo;s publishing and media industry as a focal case, this study draws on symmetry theory to develop an integrated analytical framework. It reconceptualizes government regulation as a multi-dimensional governance mechanism operating across three dimensions: resource allocation, technological innovation, and rights protection. We test this framework empirically using Xinbang Index data covering the top 10 publishing and media enterprises from 24 January 2025 to 7 December 2025. Multiple regression analysis and Spearman rank correlation are applied to assess each dimension&amp;amp;rsquo;s differential impact on content dissemination efficiency. The results yield four key findings. First, all three regulatory dimensions contribute positively to content dissemination efficiency. Second, technological innovation is the most potent symmetry-restoring lever, exerting a statistically robust direct effect on dissemination outcomes. Third, resource allocation provides a necessary foundational contribution, while rights protection operates conditionally&amp;amp;mdash;its effect is fully realized only alongside adequate technological and resource inputs. Fourth, an integrated multivariate regression confirms the cross-dimensional hierarchy: the standardized Beta coefficient for technological innovation (&amp;amp;beta; = 0.394) exceeds those for rights protection (&amp;amp;beta; = 0.294) and resource allocation (&amp;amp;beta; = 0.125). No single regulatory instrument is sufficient to achieve dynamic equilibrium. A synergistic, technology-centered combination of all three dimensions is required. This study proposes a tripartite symmetry-based governance strategy for media platform ecosystems. The symmetry framework developed here offers an analytical template for diagnosing analogous asymmetries in other platform-dependent sectors. Empirical validation beyond the Chinese publishing and media context is recommended as a priority for future research.</p>
	]]></content:encoded>

	<dc:title>From Asymmetry to Equilibrium: How Government Regulation Drives Sustainable Digital Asset Management on Media Platforms in China</dc:title>
			<dc:creator>Shaozhen Hong</dc:creator>
			<dc:creator>Yingqi Liu</dc:creator>
		<dc:identifier>doi: 10.3390/info17050454</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>454</prism:startingPage>
		<prism:doi>10.3390/info17050454</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/454</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/453">

	<title>Information, Vol. 17, Pages 453: The Vanishing User: Web Analytics in an Agent-Dominated Internet</title>
	<link>https://www.mdpi.com/2078-2489/17/5/453</link>
	<description>Conventional web analytics treats the human user as its fundamental unit of analysis, assuming stable preferences, identifiable intentions, and behavioral patterns that unfold over time. That assumption is under strain. Crawlers and traditional bots already account for a substantial fraction of online interactions, and autonomous AI agents are emerging as a further class of actors layered on top of this automated traffic. Unlike either, these agents do not possess persistent identities or psychologically grounded motivations. They are task-specific, dynamically instantiated processes whose behaviors are contingent and often orchestrated by external systems. Their presence weakens the interpretive value of core metrics, including sessions, engagement, conversion, and retention. A click may reflect an optimization routine, a proxy objective, or a recursive agent-to-agent exchange rather than meaningful human intent, and traditional inference frameworks cannot reliably distinguish among these possibilities. This is a position paper. It synthesizes literature across bot and agent detection, agent architecture, web measurement validity, governance of automated systems in adjacent sectors, and the epistemology of digital trace data, and it argues that web analytics should supplement, and in places replace, its human-centered model with an agent-aware model focused on interaction dynamics within hybrid ecosystems of human and non-human actors. The paper develops a working taxonomy of crawlers, traditional bots, AI agents, LLM-powered agents, and autonomous agents; identifies three properties of LLM agents (identity discontinuity by design, task-based instantiation, agent-to-agent loops) that distinguish the present challenge from prior bot-detection problems; examines opaque agent objectives, synthetic traffic loops, and the indistinguishability between human-originated and agent-mediated signals; and proposes five candidate measurement primitives (task chain, actor class, interaction provenance, objective alignment, signal authenticity) with explicit operational definitions. Governance machinery from energy systems and critical infrastructure offers a partial template, and we delimit which dimensions transfer and which do not. The contribution is conceptual and programmatic, presenting a vocabulary, set of candidate primitives, and research agenda for a field whose foundational unit of analysis is becoming unreliable.</description>
	<pubDate>2026-05-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 453: The Vanishing User: Web Analytics in an Agent-Dominated Internet</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/453">doi: 10.3390/info17050453</a></p>
	<p>Authors:
		Babu George
		Divya Choudhary
		</p>
	<p>Conventional web analytics treats the human user as its fundamental unit of analysis, assuming stable preferences, identifiable intentions, and behavioral patterns that unfold over time. That assumption is under strain. Crawlers and traditional bots already account for a substantial fraction of online interactions, and autonomous AI agents are emerging as a further class of actors layered on top of this automated traffic. Unlike either, these agents do not possess persistent identities or psychologically grounded motivations. They are task-specific, dynamically instantiated processes whose behaviors are contingent and often orchestrated by external systems. Their presence weakens the interpretive value of core metrics, including sessions, engagement, conversion, and retention. A click may reflect an optimization routine, a proxy objective, or a recursive agent-to-agent exchange rather than meaningful human intent, and traditional inference frameworks cannot reliably distinguish among these possibilities. This is a position paper. It synthesizes literature across bot and agent detection, agent architecture, web measurement validity, governance of automated systems in adjacent sectors, and the epistemology of digital trace data, and it argues that web analytics should supplement, and in places replace, its human-centered model with an agent-aware model focused on interaction dynamics within hybrid ecosystems of human and non-human actors. The paper develops a working taxonomy of crawlers, traditional bots, AI agents, LLM-powered agents, and autonomous agents; identifies three properties of LLM agents (identity discontinuity by design, task-based instantiation, agent-to-agent loops) that distinguish the present challenge from prior bot-detection problems; examines opaque agent objectives, synthetic traffic loops, and the indistinguishability between human-originated and agent-mediated signals; and proposes five candidate measurement primitives (task chain, actor class, interaction provenance, objective alignment, signal authenticity) with explicit operational definitions. Governance machinery from energy systems and critical infrastructure offers a partial template, and we delimit which dimensions transfer and which do not. The contribution is conceptual and programmatic, presenting a vocabulary, set of candidate primitives, and research agenda for a field whose foundational unit of analysis is becoming unreliable.</p>
	]]></content:encoded>

	<dc:title>The Vanishing User: Web Analytics in an Agent-Dominated Internet</dc:title>
			<dc:creator>Babu George</dc:creator>
			<dc:creator>Divya Choudhary</dc:creator>
		<dc:identifier>doi: 10.3390/info17050453</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-08</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-08</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>453</prism:startingPage>
		<prism:doi>10.3390/info17050453</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/453</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/452">

	<title>Information, Vol. 17, Pages 452: A Hybrid Fuzzy Rough Set, Hierarchical CFA, and Random Forest Approach for Modeling and Validating Voting Intentions: Evidence from the 2023 Thai General Election</title>
	<link>https://www.mdpi.com/2078-2489/17/5/452</link>
	<description>Against the backdrop of high digital uncertainty in the 2023 Thai General Election, this study examines how social media reshapes voting intentions through a novel hybrid framework integrating Fuzzy Rough Set Theory (FRST), Hierarchical Confirmatory Factor Analysis (CFA), and Random Forest Regression (RFR). A three-stage design&amp;amp;mdash;combining 23 expert opinions with survey data from 812 voters&amp;amp;mdash;overcomes expert ambiguity and non-linear dynamics. The findings reveal a hierarchy in digital campaigning: while Party Image (Importance = 0.3056) is the primary predictor for initial voter attention, substantive Campaign Policy (&amp;amp;beta; = 0.98) remains the definitive driver of final commitment. Other perceptual constructs, including Trust, Loyalty, and Perceived Quality, function as reinforcing dimensions that validate policy claims within the digital ecosystem. This suggests a shift where traditional broadcasting is superseded by interactive digital streaming, allowing voters to scrutinize policies through replays and public comments. The model&amp;amp;rsquo;s robustness, validated through 10-fold Random Forest Cross-Validation, demonstrates high predictive stability (Mean CV R2 = 0.840) and minimal error (MAE = 0.064). This study offers a sensitive instrument for emerging democracies and provides actionable insights, showing that substantive policy remains the ultimate driver of voter choice, even when mediated through Party Image in interactive digital environments.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 452: A Hybrid Fuzzy Rough Set, Hierarchical CFA, and Random Forest Approach for Modeling and Validating Voting Intentions: Evidence from the 2023 Thai General Election</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/452">doi: 10.3390/info17050452</a></p>
	<p>Authors:
		Prasit Puttamapadungsak
		Sumaman Pankham
		Somchai Lekcharoen
		</p>
	<p>Against the backdrop of high digital uncertainty in the 2023 Thai General Election, this study examines how social media reshapes voting intentions through a novel hybrid framework integrating Fuzzy Rough Set Theory (FRST), Hierarchical Confirmatory Factor Analysis (CFA), and Random Forest Regression (RFR). A three-stage design&amp;amp;mdash;combining 23 expert opinions with survey data from 812 voters&amp;amp;mdash;overcomes expert ambiguity and non-linear dynamics. The findings reveal a hierarchy in digital campaigning: while Party Image (Importance = 0.3056) is the primary predictor for initial voter attention, substantive Campaign Policy (&amp;amp;beta; = 0.98) remains the definitive driver of final commitment. Other perceptual constructs, including Trust, Loyalty, and Perceived Quality, function as reinforcing dimensions that validate policy claims within the digital ecosystem. This suggests a shift where traditional broadcasting is superseded by interactive digital streaming, allowing voters to scrutinize policies through replays and public comments. The model&amp;amp;rsquo;s robustness, validated through 10-fold Random Forest Cross-Validation, demonstrates high predictive stability (Mean CV R2 = 0.840) and minimal error (MAE = 0.064). This study offers a sensitive instrument for emerging democracies and provides actionable insights, showing that substantive policy remains the ultimate driver of voter choice, even when mediated through Party Image in interactive digital environments.</p>
	]]></content:encoded>

	<dc:title>A Hybrid Fuzzy Rough Set, Hierarchical CFA, and Random Forest Approach for Modeling and Validating Voting Intentions: Evidence from the 2023 Thai General Election</dc:title>
			<dc:creator>Prasit Puttamapadungsak</dc:creator>
			<dc:creator>Sumaman Pankham</dc:creator>
			<dc:creator>Somchai Lekcharoen</dc:creator>
		<dc:identifier>doi: 10.3390/info17050452</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>452</prism:startingPage>
		<prism:doi>10.3390/info17050452</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/452</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/451">

	<title>Information, Vol. 17, Pages 451: Edge-Prioritize IDS: Zero-Retraining Class Prioritization for Real-Time Edge Intrusion Detection</title>
	<link>https://www.mdpi.com/2078-2489/17/5/451</link>
	<description>Deploying deep neural networks-based intrusion detection systems on resource-constrained edge devices demands inference strategies that balance latency, energy, and accuracy under shifting threat landscapes. This paper presents Edge-Prioritize IDS, a class-prioritized early-exit framework that accelerates inference for high-risk attack classes without post-deployment retraining. A lightweight K-dimensional control vector encodes per-class runtime priorities and steers samples toward earlier exits via adaptive normalization and cost-sensitive training. Evaluation across five benchmarks NSL-KDD, CIC-IDS2017, UNSW-NB15, WISDM, and CIFAR-10 on an NVIDIA Jetson TX2 shows that Edge-Prioritize IDS preserves baseline accuracy (up to 99.6%) while reducing latency by up to 55% and energy by up to 50% for prioritized classes. Ablation studies isolate each component&amp;amp;rsquo;s contribution, and a controlled distribution-shift experiment demonstrates the sliding-window heuristic&amp;amp;rsquo;s ability to recover near-baseline latency within 500 samples under synthetic class-frequency drift. Once trained under the proposed framework, the model requires no additional retraining, firmware updates, or additional memory beyond the priority vector itself when runtime priorities change.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 451: Edge-Prioritize IDS: Zero-Retraining Class Prioritization for Real-Time Edge Intrusion Detection</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/451">doi: 10.3390/info17050451</a></p>
	<p>Authors:
		Pruthviraj Pawar
		Gregory Epiphaniou
		</p>
	<p>Deploying deep neural networks-based intrusion detection systems on resource-constrained edge devices demands inference strategies that balance latency, energy, and accuracy under shifting threat landscapes. This paper presents Edge-Prioritize IDS, a class-prioritized early-exit framework that accelerates inference for high-risk attack classes without post-deployment retraining. A lightweight K-dimensional control vector encodes per-class runtime priorities and steers samples toward earlier exits via adaptive normalization and cost-sensitive training. Evaluation across five benchmarks NSL-KDD, CIC-IDS2017, UNSW-NB15, WISDM, and CIFAR-10 on an NVIDIA Jetson TX2 shows that Edge-Prioritize IDS preserves baseline accuracy (up to 99.6%) while reducing latency by up to 55% and energy by up to 50% for prioritized classes. Ablation studies isolate each component&amp;amp;rsquo;s contribution, and a controlled distribution-shift experiment demonstrates the sliding-window heuristic&amp;amp;rsquo;s ability to recover near-baseline latency within 500 samples under synthetic class-frequency drift. Once trained under the proposed framework, the model requires no additional retraining, firmware updates, or additional memory beyond the priority vector itself when runtime priorities change.</p>
	]]></content:encoded>

	<dc:title>Edge-Prioritize IDS: Zero-Retraining Class Prioritization for Real-Time Edge Intrusion Detection</dc:title>
			<dc:creator>Pruthviraj Pawar</dc:creator>
			<dc:creator>Gregory Epiphaniou</dc:creator>
		<dc:identifier>doi: 10.3390/info17050451</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>451</prism:startingPage>
		<prism:doi>10.3390/info17050451</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/451</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/450">

	<title>Information, Vol. 17, Pages 450: Exploring the Perceived Impact of Smart City Dimensions on Supply Chain Management: A Case Study of a South African Municipality</title>
	<link>https://www.mdpi.com/2078-2489/17/5/450</link>
	<description>Municipalities in South Africa face increasing pressure to improve service delivery, operational efficiency, and sustainability amid growing urbanisation and governance challenges. The integration of smart city dimensions such as smart governance, mobility, and infrastructure offers a transformative approach to improve public sector supply chain management. However, limited empirical research exists on how these dimensions are being applied in South African municipal contexts. This study aimed to evaluate the extent to which smart city dimensions are integrated into supply chain management practices within a South African municipality and to assess the impact of these initiatives on supply chain efficiency, transparency, and sustainability. A qualitative, exploratory case study design was employed. Twenty senior managers and key stakeholders from the supply chain department of the selected municipality were purposively sampled. Data were collected through semi-structured face-to-face interviews and analysed thematically using NVivo software. Lincoln and Guba&amp;amp;rsquo;s trustworthiness framework guided the study&amp;amp;rsquo;s rigour. The findings revealed partial and uneven integration of smart city dimensions, with notable developments in smart governance and mobility, but limited progress in areas such as infrastructure digitalisation and citizen-centric data platforms. Participants highlighted both innovation drivers and institutional barriers affecting the transition to smart-enabled supply chain practices. Smart city dimensions present significant potential to improve municipal supply chain management; however, effective integration requires structural alignment, digital investment, and organisational readiness. This study provides context-specific insights into the uneven and fragmented integration of smart city dimensions within municipal supply chain systems in a developing country context, emphasising the impact of institutional constraints, digital capability gaps, and governance misalignments on implementation outcomes.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 450: Exploring the Perceived Impact of Smart City Dimensions on Supply Chain Management: A Case Study of a South African Municipality</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/450">doi: 10.3390/info17050450</a></p>
	<p>Authors:
		Alexander Bradley Samuels
		</p>
	<p>Municipalities in South Africa face increasing pressure to improve service delivery, operational efficiency, and sustainability amid growing urbanisation and governance challenges. The integration of smart city dimensions such as smart governance, mobility, and infrastructure offers a transformative approach to improve public sector supply chain management. However, limited empirical research exists on how these dimensions are being applied in South African municipal contexts. This study aimed to evaluate the extent to which smart city dimensions are integrated into supply chain management practices within a South African municipality and to assess the impact of these initiatives on supply chain efficiency, transparency, and sustainability. A qualitative, exploratory case study design was employed. Twenty senior managers and key stakeholders from the supply chain department of the selected municipality were purposively sampled. Data were collected through semi-structured face-to-face interviews and analysed thematically using NVivo software. Lincoln and Guba&amp;amp;rsquo;s trustworthiness framework guided the study&amp;amp;rsquo;s rigour. The findings revealed partial and uneven integration of smart city dimensions, with notable developments in smart governance and mobility, but limited progress in areas such as infrastructure digitalisation and citizen-centric data platforms. Participants highlighted both innovation drivers and institutional barriers affecting the transition to smart-enabled supply chain practices. Smart city dimensions present significant potential to improve municipal supply chain management; however, effective integration requires structural alignment, digital investment, and organisational readiness. This study provides context-specific insights into the uneven and fragmented integration of smart city dimensions within municipal supply chain systems in a developing country context, emphasising the impact of institutional constraints, digital capability gaps, and governance misalignments on implementation outcomes.</p>
	]]></content:encoded>

	<dc:title>Exploring the Perceived Impact of Smart City Dimensions on Supply Chain Management: A Case Study of a South African Municipality</dc:title>
			<dc:creator>Alexander Bradley Samuels</dc:creator>
		<dc:identifier>doi: 10.3390/info17050450</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>450</prism:startingPage>
		<prism:doi>10.3390/info17050450</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/450</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/449">

	<title>Information, Vol. 17, Pages 449: Linguistic Polarity and Decision Architecture in LLM-Based Abstract Screening for Systematic Reviews</title>
	<link>https://www.mdpi.com/2078-2489/17/5/449</link>
	<description>Large language models (LLMs) are increasingly investigated for abstract screening in systematic reviews, yet it remains unclear whether screening errors attributed to linguistic complexity arise from intrinsic semantic sensitivity or from its interaction with decision architecture. We examined how five polarity variants of logically equivalent eligibility criteria&amp;amp;mdash;affirmative inclusion, antonymic exclusion, predicate negation, verb-level negation, and double negation&amp;amp;mdash;affect screening outcomes in a controlled biomedical task. Using 1000 abstracts from a reconstructed Cochrane review corpus (50 TARGET; 950 non-targets), we implemented four abstract-visible criteria within a sequential hard-gated pipeline, where failure at any step triggered irreversible exclusion. Under hard gating, linguistic polarity alone produced substantial and statistically significant variation in recall. For GPT-5.1, recall ranged from 0.72 to 0.32 despite identical logical predicates and input data. Replication with GPT-3.5 Turbo yielded a similar divergence (0.92&amp;amp;ndash;0.18), confirming generalization across model generations. TARGET losses were concentrated at criteria typically satisfied but inconsistently reported in abstracts, indicating conservative exclusion under evidential under-specification. To assess whether this effect is semantic or architectural, we reimplemented screening using a scoring-based evidence-accumulation framework in which each criterion contributed graded support and inclusion was determined by a tunable threshold. Under scoring, recall increased across all variants and converged within a high-sensitivity regime, while residual polarity effects were attenuated but remained detectable. Linguistic differences shifted from structural recall collapse to controlled precision&amp;amp;ndash;recall trade-offs. These findings show that negation sensitivity is strongly mediated by decision architecture. Irreversible gating amplifies local uncertainty into false-negative exclusion, whereas cumulative scoring preserves uncertainty and enables controllable operating thresholds.</description>
	<pubDate>2026-05-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 449: Linguistic Polarity and Decision Architecture in LLM-Based Abstract Screening for Systematic Reviews</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/449">doi: 10.3390/info17050449</a></p>
	<p>Authors:
		Amir M. Behrouzian
		Marco Meleti
		Maria Teresa Colangelo
		Elena Calciolari
		Carlo Galli
		</p>
	<p>Large language models (LLMs) are increasingly investigated for abstract screening in systematic reviews, yet it remains unclear whether screening errors attributed to linguistic complexity arise from intrinsic semantic sensitivity or from its interaction with decision architecture. We examined how five polarity variants of logically equivalent eligibility criteria&amp;amp;mdash;affirmative inclusion, antonymic exclusion, predicate negation, verb-level negation, and double negation&amp;amp;mdash;affect screening outcomes in a controlled biomedical task. Using 1000 abstracts from a reconstructed Cochrane review corpus (50 TARGET; 950 non-targets), we implemented four abstract-visible criteria within a sequential hard-gated pipeline, where failure at any step triggered irreversible exclusion. Under hard gating, linguistic polarity alone produced substantial and statistically significant variation in recall. For GPT-5.1, recall ranged from 0.72 to 0.32 despite identical logical predicates and input data. Replication with GPT-3.5 Turbo yielded a similar divergence (0.92&amp;amp;ndash;0.18), confirming generalization across model generations. TARGET losses were concentrated at criteria typically satisfied but inconsistently reported in abstracts, indicating conservative exclusion under evidential under-specification. To assess whether this effect is semantic or architectural, we reimplemented screening using a scoring-based evidence-accumulation framework in which each criterion contributed graded support and inclusion was determined by a tunable threshold. Under scoring, recall increased across all variants and converged within a high-sensitivity regime, while residual polarity effects were attenuated but remained detectable. Linguistic differences shifted from structural recall collapse to controlled precision&amp;amp;ndash;recall trade-offs. These findings show that negation sensitivity is strongly mediated by decision architecture. Irreversible gating amplifies local uncertainty into false-negative exclusion, whereas cumulative scoring preserves uncertainty and enables controllable operating thresholds.</p>
	]]></content:encoded>

	<dc:title>Linguistic Polarity and Decision Architecture in LLM-Based Abstract Screening for Systematic Reviews</dc:title>
			<dc:creator>Amir M. Behrouzian</dc:creator>
			<dc:creator>Marco Meleti</dc:creator>
			<dc:creator>Maria Teresa Colangelo</dc:creator>
			<dc:creator>Elena Calciolari</dc:creator>
			<dc:creator>Carlo Galli</dc:creator>
		<dc:identifier>doi: 10.3390/info17050449</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-07</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-07</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>449</prism:startingPage>
		<prism:doi>10.3390/info17050449</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/449</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/448">

	<title>Information, Vol. 17, Pages 448: Explainable Transformer-Based Framework for Suicide Risk Detection: Deep Learning with Interpretability for Mental Health Crisis Identification</title>
	<link>https://www.mdpi.com/2078-2489/17/5/448</link>
	<description>The public health concern of suicide continues to rise and is increasingly prevalent on social media. The severity of this growing issue highlights the need for improved methods for detecting suicide risk. Many current deep learning approaches do not possess the required level of explainability for application in clinical settings. This study proposes the development of a transformer-based framework called &amp;amp;ldquo;CrisisFormer,&amp;amp;rdquo; which was trained on an imbalanced dataset containing 40,000 Reddit posts from the Suicide Watch subreddit and enhanced using DistilBERT. Additionally, the CrisisFormer framework uses three forms of explainable artificial intelligence for interpreting results: SHapley Additive exPlanations (SHAP), Local Interpretable Model-Agnostic Explanations (LIME), and transformer attention visualizations. The CrisisFormer framework achieved superior results for detecting the risk of suicide, with 96.25% accuracy, 96.30% precision, 96.25% recall, 96.25% F1 score, and 0.9944 AUC, compared to traditional models such as CNN, LSTM, and BiLSTM. Furthermore, by including clinically relevant suicide terms in its results, CrisisFormer demonstrates a high potential for incorporation into real-world mental health systems for intervention during ongoing mental health crises.</description>
	<pubDate>2026-05-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 448: Explainable Transformer-Based Framework for Suicide Risk Detection: Deep Learning with Interpretability for Mental Health Crisis Identification</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/448">doi: 10.3390/info17050448</a></p>
	<p>Authors:
		Muhammad Azhar
		Muhammad Arman
		Adeen Amjad
		Deshinta Arrova Dewi
		Muhammad Usman Ahmad
		Shafiq Hussain
		</p>
	<p>The public health concern of suicide continues to rise and is increasingly prevalent on social media. The severity of this growing issue highlights the need for improved methods for detecting suicide risk. Many current deep learning approaches do not possess the required level of explainability for application in clinical settings. This study proposes the development of a transformer-based framework called &amp;amp;ldquo;CrisisFormer,&amp;amp;rdquo; which was trained on an imbalanced dataset containing 40,000 Reddit posts from the Suicide Watch subreddit and enhanced using DistilBERT. Additionally, the CrisisFormer framework uses three forms of explainable artificial intelligence for interpreting results: SHapley Additive exPlanations (SHAP), Local Interpretable Model-Agnostic Explanations (LIME), and transformer attention visualizations. The CrisisFormer framework achieved superior results for detecting the risk of suicide, with 96.25% accuracy, 96.30% precision, 96.25% recall, 96.25% F1 score, and 0.9944 AUC, compared to traditional models such as CNN, LSTM, and BiLSTM. Furthermore, by including clinically relevant suicide terms in its results, CrisisFormer demonstrates a high potential for incorporation into real-world mental health systems for intervention during ongoing mental health crises.</p>
	]]></content:encoded>

	<dc:title>Explainable Transformer-Based Framework for Suicide Risk Detection: Deep Learning with Interpretability for Mental Health Crisis Identification</dc:title>
			<dc:creator>Muhammad Azhar</dc:creator>
			<dc:creator>Muhammad Arman</dc:creator>
			<dc:creator>Adeen Amjad</dc:creator>
			<dc:creator>Deshinta Arrova Dewi</dc:creator>
			<dc:creator>Muhammad Usman Ahmad</dc:creator>
			<dc:creator>Shafiq Hussain</dc:creator>
		<dc:identifier>doi: 10.3390/info17050448</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-06</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-06</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>448</prism:startingPage>
		<prism:doi>10.3390/info17050448</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/448</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/447">

	<title>Information, Vol. 17, Pages 447: Formal Semantics of Governance History Validity in Encrypted Storage</title>
	<link>https://www.mdpi.com/2078-2489/17/5/447</link>
	<description>Encrypted storage systems increasingly rely on governance mechanisms such as delegation, revocation, key updates, and policy evolution. While existing approaches provide strong guarantees for access enforcement, integrity, and transparency, they do not address a fundamental question: under which conditions can an observed sequence of governance events be accepted as a semantically valid evolution of authorization state? This work introduces a formal semantic framework for governance validity based on observable evidence. Governance is modeled as an admissibility-constrained state transition system in which events are accepted only if they satisfy explicit authorization, reference, temporal, revocation, and evidence conditions. The framework defines valid governance histories as sequences of admissible events; characterizes the conditions for deterministic state reconstruction; and establishes invariants capturing correctness properties such as revocation soundness, policy-constrained evolution, evidence completeness, non-equivocation, and temporal coherence. It also defines event-specific evidence obligations that support independent verification. The proposed approach is architecture-independent and does not prescribe specific enforcement or logging mechanisms, focusing instead on the semantic conditions required for accepting governance histories as valid from observable evidence. In addition, the framework can be instantiated as an independent verification layer that operates over observable governance traces without requiring access to internal system states.</description>
	<pubDate>2026-05-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 447: Formal Semantics of Governance History Validity in Encrypted Storage</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/447">doi: 10.3390/info17050447</a></p>
	<p>Authors:
		Jesús F. Rodríguez-Aragón
		Carolina Zato
		Fernando De la Prieta
		</p>
	<p>Encrypted storage systems increasingly rely on governance mechanisms such as delegation, revocation, key updates, and policy evolution. While existing approaches provide strong guarantees for access enforcement, integrity, and transparency, they do not address a fundamental question: under which conditions can an observed sequence of governance events be accepted as a semantically valid evolution of authorization state? This work introduces a formal semantic framework for governance validity based on observable evidence. Governance is modeled as an admissibility-constrained state transition system in which events are accepted only if they satisfy explicit authorization, reference, temporal, revocation, and evidence conditions. The framework defines valid governance histories as sequences of admissible events; characterizes the conditions for deterministic state reconstruction; and establishes invariants capturing correctness properties such as revocation soundness, policy-constrained evolution, evidence completeness, non-equivocation, and temporal coherence. It also defines event-specific evidence obligations that support independent verification. The proposed approach is architecture-independent and does not prescribe specific enforcement or logging mechanisms, focusing instead on the semantic conditions required for accepting governance histories as valid from observable evidence. In addition, the framework can be instantiated as an independent verification layer that operates over observable governance traces without requiring access to internal system states.</p>
	]]></content:encoded>

	<dc:title>Formal Semantics of Governance History Validity in Encrypted Storage</dc:title>
			<dc:creator>Jesús F. Rodríguez-Aragón</dc:creator>
			<dc:creator>Carolina Zato</dc:creator>
			<dc:creator>Fernando De la Prieta</dc:creator>
		<dc:identifier>doi: 10.3390/info17050447</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-06</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-06</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>447</prism:startingPage>
		<prism:doi>10.3390/info17050447</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/447</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/446">

	<title>Information, Vol. 17, Pages 446: Fractional Variational Graph Autoencoders for Enhancing Non-Local Representation Learning on Graphs</title>
	<link>https://www.mdpi.com/2078-2489/17/5/446</link>
	<description>While Graph Autoencoders (GAEs) have become a standard for unsupervised representation learning, their reliance on integer-order convolutions inherently restricts information propagation to immediate local neighborhoods. This paper introduces the Fractional Graph Autoencoder (FGAE) and its variational extension (FVGAE) to move beyond these local constraints. By integrating fractional Laplace operators, our framework generalizes conventional GAEs and enables tunable non-local propagation. We show that the fractional order &amp;amp;alpha; acts as a structural regularizer, utilizing the Green&amp;amp;rsquo;s function of anomalous diffusion to induce a form of structural memory within the latent space. This allows the model to recover long-range dependencies that are typically lost in standard architectures. Systematic benchmarking across eight datasets&amp;amp;mdash;ranging from homophilic citation networks to heterophilic and dense product graphs&amp;amp;mdash;shows that these fractional variants consistently outperform both foundational and state-of-the-art baselines (ARGA, SIG-VAE, and GraphMAE). Notably, on the Amazon Computers and Citeseer datasets, our methods achieve relative increases in Normalized Mutual Information (NMI) of 77.55% and 67.28%, respectively. Statistical analysis confirms these gains are robust, with large effect sizes (Cohen&amp;amp;rsquo;s d&amp;amp;gt;0.80) and significance at p&amp;amp;lt;0.05. These findings suggest that fractional graph autoencoding offers a mathematically grounded inductive bias for capturing the complex, multi-scale dynamics of real-world networked systems.</description>
	<pubDate>2026-05-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 446: Fractional Variational Graph Autoencoders for Enhancing Non-Local Representation Learning on Graphs</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/446">doi: 10.3390/info17050446</a></p>
	<p>Authors:
		Mohamed Ilyas El Harrak
		Omar Bahou
		Karim El Moutaouakil
		Ahmed Nuino
		Eddakir Abdellatif
		Alina-Mihaela Patriciu
		</p>
	<p>While Graph Autoencoders (GAEs) have become a standard for unsupervised representation learning, their reliance on integer-order convolutions inherently restricts information propagation to immediate local neighborhoods. This paper introduces the Fractional Graph Autoencoder (FGAE) and its variational extension (FVGAE) to move beyond these local constraints. By integrating fractional Laplace operators, our framework generalizes conventional GAEs and enables tunable non-local propagation. We show that the fractional order &amp;amp;alpha; acts as a structural regularizer, utilizing the Green&amp;amp;rsquo;s function of anomalous diffusion to induce a form of structural memory within the latent space. This allows the model to recover long-range dependencies that are typically lost in standard architectures. Systematic benchmarking across eight datasets&amp;amp;mdash;ranging from homophilic citation networks to heterophilic and dense product graphs&amp;amp;mdash;shows that these fractional variants consistently outperform both foundational and state-of-the-art baselines (ARGA, SIG-VAE, and GraphMAE). Notably, on the Amazon Computers and Citeseer datasets, our methods achieve relative increases in Normalized Mutual Information (NMI) of 77.55% and 67.28%, respectively. Statistical analysis confirms these gains are robust, with large effect sizes (Cohen&amp;amp;rsquo;s d&amp;amp;gt;0.80) and significance at p&amp;amp;lt;0.05. These findings suggest that fractional graph autoencoding offers a mathematically grounded inductive bias for capturing the complex, multi-scale dynamics of real-world networked systems.</p>
	]]></content:encoded>

	<dc:title>Fractional Variational Graph Autoencoders for Enhancing Non-Local Representation Learning on Graphs</dc:title>
			<dc:creator>Mohamed Ilyas El Harrak</dc:creator>
			<dc:creator>Omar Bahou</dc:creator>
			<dc:creator>Karim El Moutaouakil</dc:creator>
			<dc:creator>Ahmed Nuino</dc:creator>
			<dc:creator>Eddakir Abdellatif</dc:creator>
			<dc:creator>Alina-Mihaela Patriciu</dc:creator>
		<dc:identifier>doi: 10.3390/info17050446</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-06</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-06</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>446</prism:startingPage>
		<prism:doi>10.3390/info17050446</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/446</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/445">

	<title>Information, Vol. 17, Pages 445: Intelligent Task Distribution Using Hybrid Algorithms and Enhancing Performance by Integrating FRLB and PBLB</title>
	<link>https://www.mdpi.com/2078-2489/17/5/445</link>
	<description>In modern computing environments characterized by high variability and complex workloads, traditional load-balancing algorithms such as Round Robin and Least Connections are often found to be less effective in distributing tasks and maintaining optimal performance. In this paper, a hybrid load-balancing algorithm is proposed, where the strengths of Fastest Response Load Balancing (FRLB) and Priority-Based Load Balancing (PBLB) are combined. Through this adaptive approach, response times are minimized and load distribution across heterogeneous server environments is balanced more effectively. In the recent literature, the need for enhanced load-balancing solutions that can adapt to dynamic conditions in cloud computing, IoT, and large-scale web services has been increasingly emphasized. By integrating a hybrid mechanism, a robust solution is provided by the hybrid algorithm, which is designed to merge between FRLB and PBLB. As demonstrated through simulations, a noticeable improvement in performance is achieved, with a significant reduction in average response time when compared to FRLB and PBLB. The proposed algorithm outperforms the classical FRLB and PBLB.</description>
	<pubDate>2026-05-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 445: Intelligent Task Distribution Using Hybrid Algorithms and Enhancing Performance by Integrating FRLB and PBLB</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/445">doi: 10.3390/info17050445</a></p>
	<p>Authors:
		Yahia Jazyah
		</p>
	<p>In modern computing environments characterized by high variability and complex workloads, traditional load-balancing algorithms such as Round Robin and Least Connections are often found to be less effective in distributing tasks and maintaining optimal performance. In this paper, a hybrid load-balancing algorithm is proposed, where the strengths of Fastest Response Load Balancing (FRLB) and Priority-Based Load Balancing (PBLB) are combined. Through this adaptive approach, response times are minimized and load distribution across heterogeneous server environments is balanced more effectively. In the recent literature, the need for enhanced load-balancing solutions that can adapt to dynamic conditions in cloud computing, IoT, and large-scale web services has been increasingly emphasized. By integrating a hybrid mechanism, a robust solution is provided by the hybrid algorithm, which is designed to merge between FRLB and PBLB. As demonstrated through simulations, a noticeable improvement in performance is achieved, with a significant reduction in average response time when compared to FRLB and PBLB. The proposed algorithm outperforms the classical FRLB and PBLB.</p>
	]]></content:encoded>

	<dc:title>Intelligent Task Distribution Using Hybrid Algorithms and Enhancing Performance by Integrating FRLB and PBLB</dc:title>
			<dc:creator>Yahia Jazyah</dc:creator>
		<dc:identifier>doi: 10.3390/info17050445</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-05</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-05</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>445</prism:startingPage>
		<prism:doi>10.3390/info17050445</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/445</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/444">

	<title>Information, Vol. 17, Pages 444: Bridging the Knowledge Void: A Synthetic Near-Empty Review of Intelligent Evolutionary Games&amp;rsquo; Employment in Healthcare</title>
	<link>https://www.mdpi.com/2078-2489/17/5/444</link>
	<description>Background: The convergence of Evolutionary Game Theory (EGT) and Artificial Intelligence (AI) has established the field of Intelligent Evolutionary Games (IEGs). While IEG applications have flourished in general systems and social sciences, their operationalization within healthcare (IEG Health) remains significantly underdeveloped. This study identifies a &amp;amp;ldquo;knowledge void&amp;amp;rdquo; in the literature, where the bottleneck is not a lack of clinical data but a scarcity of frameworks that integrate intelligent strategic modelling into clinical practice. Methods: We employ the Synthetic Near-Empty Review (SNER) framework, utilizing Synthetic Knowledge Synthesis (SKS) and bibliometric triangulation via VOSviewer. Three distinct corpora&amp;amp;mdash;IEG Health, EG Health, and IEG All (IEG)&amp;amp;mdash;were harvested from Scopus and mapped to identify thematic clusters and translation pathways. Results: The analysis reveals that IEG Health is a nascent domain currently focused on service regulation in elderly care and chronic disease management. We demonstrate a &amp;amp;ldquo;Translation Framework&amp;amp;rdquo; to bridge the research void, mapping concepts like Social Trust and Reputation Management from the broader IEG literature into clinical-specific models, such as Doctor-AI Adoption and Adaptive Coordination Games. Conclusions: By shifting from static Replicator Dynamics to Adaptive Learning Strategies (e.g., MARL and Bayesian updating), IEG Health can address critical challenges like algorithm aversion and clinical deskilling. Furthermore, transitioning these models into clinical environments requires the incorporation of structured ethical guidelines, such as ALTAI, to ensure algorithmic accountability. This study provides a structured foundation for future research to transition from theoretical modelling to AI-augmented clinical decision-making.</description>
	<pubDate>2026-05-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 444: Bridging the Knowledge Void: A Synthetic Near-Empty Review of Intelligent Evolutionary Games&amp;rsquo; Employment in Healthcare</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/444">doi: 10.3390/info17050444</a></p>
	<p>Authors:
		Peter Kokol
		Helena Blažun Vošner
		Jernej Završnik
		Bojan Žlahtič
		</p>
	<p>Background: The convergence of Evolutionary Game Theory (EGT) and Artificial Intelligence (AI) has established the field of Intelligent Evolutionary Games (IEGs). While IEG applications have flourished in general systems and social sciences, their operationalization within healthcare (IEG Health) remains significantly underdeveloped. This study identifies a &amp;amp;ldquo;knowledge void&amp;amp;rdquo; in the literature, where the bottleneck is not a lack of clinical data but a scarcity of frameworks that integrate intelligent strategic modelling into clinical practice. Methods: We employ the Synthetic Near-Empty Review (SNER) framework, utilizing Synthetic Knowledge Synthesis (SKS) and bibliometric triangulation via VOSviewer. Three distinct corpora&amp;amp;mdash;IEG Health, EG Health, and IEG All (IEG)&amp;amp;mdash;were harvested from Scopus and mapped to identify thematic clusters and translation pathways. Results: The analysis reveals that IEG Health is a nascent domain currently focused on service regulation in elderly care and chronic disease management. We demonstrate a &amp;amp;ldquo;Translation Framework&amp;amp;rdquo; to bridge the research void, mapping concepts like Social Trust and Reputation Management from the broader IEG literature into clinical-specific models, such as Doctor-AI Adoption and Adaptive Coordination Games. Conclusions: By shifting from static Replicator Dynamics to Adaptive Learning Strategies (e.g., MARL and Bayesian updating), IEG Health can address critical challenges like algorithm aversion and clinical deskilling. Furthermore, transitioning these models into clinical environments requires the incorporation of structured ethical guidelines, such as ALTAI, to ensure algorithmic accountability. This study provides a structured foundation for future research to transition from theoretical modelling to AI-augmented clinical decision-making.</p>
	]]></content:encoded>

	<dc:title>Bridging the Knowledge Void: A Synthetic Near-Empty Review of Intelligent Evolutionary Games&amp;amp;rsquo; Employment in Healthcare</dc:title>
			<dc:creator>Peter Kokol</dc:creator>
			<dc:creator>Helena Blažun Vošner</dc:creator>
			<dc:creator>Jernej Završnik</dc:creator>
			<dc:creator>Bojan Žlahtič</dc:creator>
		<dc:identifier>doi: 10.3390/info17050444</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-05</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-05</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>444</prism:startingPage>
		<prism:doi>10.3390/info17050444</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/444</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/443">

	<title>Information, Vol. 17, Pages 443: Designing for Trust, Progress, and Dignity: A Conceptual Framework for Reliability, Responsiveness, and Relational Quality in AI-Enabled Service Systems</title>
	<link>https://www.mdpi.com/2078-2489/17/5/443</link>
	<description>AI is now embedded in frontline service at scale, yet the design frameworks managers reach for were built around human agents and do not translate cleanly to systems that generate rather than retrieve, that automate rather than augment. This paper argues that three design challenges sit at the heart of the problem, though they are rarely treated as a connected set. Generative AI can produce fluent, confident outputs that are simply wrong, which is a qualitatively different kind of reliability failure from anything SERVQUAL was designed to address. AI can reply instantly while leaving the customer no closer to resolution, exposing a gap between speed and what we might call felt responsiveness. And it faces an awkward relational tension. Overclaiming warmth triggers distrust, yet there are genuine service contexts in which the non-human nature of the system is a feature rather than a liability. The RRR Design Framework developed here extends established service quality dimensions to the AI context, organising fifteen prescriptive design principles around reliability, responsiveness, and relational quality, each reconceptualised for AI-mediated service. The principles follow a prevent-and-recover logic within each dimension and are tied together by a single strategic proposition, which is to automate to protect relationships. Four empirically testable propositions are derived from the framework, each operationalised with measurable constructs, moderating conditions, and falsifiable null cases. The framework is most applicable to hybrid human-AI frontline systems where customers are actively working toward a resolution.</description>
	<pubDate>2026-05-04</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 443: Designing for Trust, Progress, and Dignity: A Conceptual Framework for Reliability, Responsiveness, and Relational Quality in AI-Enabled Service Systems</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/443">doi: 10.3390/info17050443</a></p>
	<p>Authors:
		Mark Colgate
		Orla Colgate
		</p>
	<p>AI is now embedded in frontline service at scale, yet the design frameworks managers reach for were built around human agents and do not translate cleanly to systems that generate rather than retrieve, that automate rather than augment. This paper argues that three design challenges sit at the heart of the problem, though they are rarely treated as a connected set. Generative AI can produce fluent, confident outputs that are simply wrong, which is a qualitatively different kind of reliability failure from anything SERVQUAL was designed to address. AI can reply instantly while leaving the customer no closer to resolution, exposing a gap between speed and what we might call felt responsiveness. And it faces an awkward relational tension. Overclaiming warmth triggers distrust, yet there are genuine service contexts in which the non-human nature of the system is a feature rather than a liability. The RRR Design Framework developed here extends established service quality dimensions to the AI context, organising fifteen prescriptive design principles around reliability, responsiveness, and relational quality, each reconceptualised for AI-mediated service. The principles follow a prevent-and-recover logic within each dimension and are tied together by a single strategic proposition, which is to automate to protect relationships. Four empirically testable propositions are derived from the framework, each operationalised with measurable constructs, moderating conditions, and falsifiable null cases. The framework is most applicable to hybrid human-AI frontline systems where customers are actively working toward a resolution.</p>
	]]></content:encoded>

	<dc:title>Designing for Trust, Progress, and Dignity: A Conceptual Framework for Reliability, Responsiveness, and Relational Quality in AI-Enabled Service Systems</dc:title>
			<dc:creator>Mark Colgate</dc:creator>
			<dc:creator>Orla Colgate</dc:creator>
		<dc:identifier>doi: 10.3390/info17050443</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-04</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-04</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>443</prism:startingPage>
		<prism:doi>10.3390/info17050443</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/443</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/442">

	<title>Information, Vol. 17, Pages 442: A Multi-Aspect Transformer with Explainable AI for Recognizing Implicit Suicidal and Depressive Risk Indicators</title>
	<link>https://www.mdpi.com/2078-2489/17/5/442</link>
	<description>Early detection of suicidal ideation and depressive risk remains a critical challenge, particularly when individuals express distress implicitly through metaphorical or obfuscated language. Existing approaches primarily rely on explicit linguistic signals, limiting their effectiveness in real-world settings. This paper proposes a unified multi-aspect transformer-based framework that integrates multi-source learning, multi-task optimization, affective feature fusion, and adversarial training to detect implicit psychological risk indicators in textual data. The model jointly learns suicidal ideation detection, depression severity classification, and perceived threat detection, while incorporating emotional representations derived from valence, arousal, and polarity signals. To improve robustness, an adversarial training strategy is employed to simulate obfuscated expressions, enhancing robustness and generalization under linguistic perturbations. Interpretability is ensured through a hybrid explainable AI approach combining attention mechanisms and SHAP-based feature attribution. Extensive experiments conducted on four benchmark datasets demonstrate that the proposed approach achieves state-of-the-art performance (F1-score = 0.91), with statistically significant improvements over strong baselines. Additional analyses, including ablation studies, adversarial evaluation, and calibration assessment, confirm the effectiveness, robustness, and reliability of the proposed framework. These results highlight the potential of the model for deployment in high-stakes applications such as clinical triage and online risk monitoring, where early and interpretable detection of concealed psychological distress is essential.</description>
	<pubDate>2026-05-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 442: A Multi-Aspect Transformer with Explainable AI for Recognizing Implicit Suicidal and Depressive Risk Indicators</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/442">doi: 10.3390/info17050442</a></p>
	<p>Authors:
		Aziz Boujeddaine
		Hamid Khalifi
		Youssef Ghanou
		Sara Riahi
		Walid Cherif
		</p>
	<p>Early detection of suicidal ideation and depressive risk remains a critical challenge, particularly when individuals express distress implicitly through metaphorical or obfuscated language. Existing approaches primarily rely on explicit linguistic signals, limiting their effectiveness in real-world settings. This paper proposes a unified multi-aspect transformer-based framework that integrates multi-source learning, multi-task optimization, affective feature fusion, and adversarial training to detect implicit psychological risk indicators in textual data. The model jointly learns suicidal ideation detection, depression severity classification, and perceived threat detection, while incorporating emotional representations derived from valence, arousal, and polarity signals. To improve robustness, an adversarial training strategy is employed to simulate obfuscated expressions, enhancing robustness and generalization under linguistic perturbations. Interpretability is ensured through a hybrid explainable AI approach combining attention mechanisms and SHAP-based feature attribution. Extensive experiments conducted on four benchmark datasets demonstrate that the proposed approach achieves state-of-the-art performance (F1-score = 0.91), with statistically significant improvements over strong baselines. Additional analyses, including ablation studies, adversarial evaluation, and calibration assessment, confirm the effectiveness, robustness, and reliability of the proposed framework. These results highlight the potential of the model for deployment in high-stakes applications such as clinical triage and online risk monitoring, where early and interpretable detection of concealed psychological distress is essential.</p>
	]]></content:encoded>

	<dc:title>A Multi-Aspect Transformer with Explainable AI for Recognizing Implicit Suicidal and Depressive Risk Indicators</dc:title>
			<dc:creator>Aziz Boujeddaine</dc:creator>
			<dc:creator>Hamid Khalifi</dc:creator>
			<dc:creator>Youssef Ghanou</dc:creator>
			<dc:creator>Sara Riahi</dc:creator>
			<dc:creator>Walid Cherif</dc:creator>
		<dc:identifier>doi: 10.3390/info17050442</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-03</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-03</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>442</prism:startingPage>
		<prism:doi>10.3390/info17050442</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/442</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/441">

	<title>Information, Vol. 17, Pages 441: GenForge: An LMM Agent Framework for Intelligent Knowledge Extraction from Nuclear Fuel Reprocessing Literature</title>
	<link>https://www.mdpi.com/2078-2489/17/5/441</link>
	<description>Nuclear Fuel Reprocessing literature contains critical experimental parameters, safety information, theoretical relations, and process data that are highly heterogeneous and subject to strict logical constraints. Manually interpreting complex charts and handling tedious database schema mappings imposes a high cognitive load on experts. Although existing Large Multimodal Models (LMMs) have demonstrated strong potential in information extraction, they often face engineering bottlenecks&amp;amp;mdash;such as poor structural compliance and a tendency to confuse entity logic&amp;amp;mdash;when dealing with domain databases containing complex foreign key constraints. To address this, we propose GenForge, a schema-aware extraction framework. By taking the target database schema as an explicit constraint, GenForge achieves automatic task decomposition and formatting self-correction via a &amp;amp;ldquo;Generation&amp;amp;ndash;Execution&amp;amp;ndash;Reflection&amp;amp;ndash;Reforging&amp;amp;rdquo; iterative loop. Additionally, a Local ID mechanism is introduced to ensure data lineage consistency. We evaluated GenForge on four internal evaluation corpora from nuclear fuel reprocessing literature, each aligned with a distinct database schema: Safety Event and Causal Context Extraction Schema, Property-Condition Data Extraction Schema, Model-Parameter Association Schema, and Process Topology and Stream Mapping Schema. On the independent test set, GenForge achieved 88.0% precision, 83.0% recall, and a 98.6% Schema Compliance Rate (SCR). These results indicate that GenForge, as an expert-assisted framework, reduces the need for manual JSON debugging and supports practical schema-constrained knowledge extraction under four schema-specific evaluation settings within the Nuclear Fuel Reprocessing domain.</description>
	<pubDate>2026-05-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 441: GenForge: An LMM Agent Framework for Intelligent Knowledge Extraction from Nuclear Fuel Reprocessing Literature</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/441">doi: 10.3390/info17050441</a></p>
	<p>Authors:
		Hengfei Wang
		Ting Yu
		Yuanzheng Xin
		Zonghui Lu
		Shuangjian Li
		Yingting Luo
		Guoan Ye
		Helin Gong
		Tao Zhu
		</p>
	<p>Nuclear Fuel Reprocessing literature contains critical experimental parameters, safety information, theoretical relations, and process data that are highly heterogeneous and subject to strict logical constraints. Manually interpreting complex charts and handling tedious database schema mappings imposes a high cognitive load on experts. Although existing Large Multimodal Models (LMMs) have demonstrated strong potential in information extraction, they often face engineering bottlenecks&amp;amp;mdash;such as poor structural compliance and a tendency to confuse entity logic&amp;amp;mdash;when dealing with domain databases containing complex foreign key constraints. To address this, we propose GenForge, a schema-aware extraction framework. By taking the target database schema as an explicit constraint, GenForge achieves automatic task decomposition and formatting self-correction via a &amp;amp;ldquo;Generation&amp;amp;ndash;Execution&amp;amp;ndash;Reflection&amp;amp;ndash;Reforging&amp;amp;rdquo; iterative loop. Additionally, a Local ID mechanism is introduced to ensure data lineage consistency. We evaluated GenForge on four internal evaluation corpora from nuclear fuel reprocessing literature, each aligned with a distinct database schema: Safety Event and Causal Context Extraction Schema, Property-Condition Data Extraction Schema, Model-Parameter Association Schema, and Process Topology and Stream Mapping Schema. On the independent test set, GenForge achieved 88.0% precision, 83.0% recall, and a 98.6% Schema Compliance Rate (SCR). These results indicate that GenForge, as an expert-assisted framework, reduces the need for manual JSON debugging and supports practical schema-constrained knowledge extraction under four schema-specific evaluation settings within the Nuclear Fuel Reprocessing domain.</p>
	]]></content:encoded>

	<dc:title>GenForge: An LMM Agent Framework for Intelligent Knowledge Extraction from Nuclear Fuel Reprocessing Literature</dc:title>
			<dc:creator>Hengfei Wang</dc:creator>
			<dc:creator>Ting Yu</dc:creator>
			<dc:creator>Yuanzheng Xin</dc:creator>
			<dc:creator>Zonghui Lu</dc:creator>
			<dc:creator>Shuangjian Li</dc:creator>
			<dc:creator>Yingting Luo</dc:creator>
			<dc:creator>Guoan Ye</dc:creator>
			<dc:creator>Helin Gong</dc:creator>
			<dc:creator>Tao Zhu</dc:creator>
		<dc:identifier>doi: 10.3390/info17050441</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-03</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-03</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>441</prism:startingPage>
		<prism:doi>10.3390/info17050441</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/441</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/440">

	<title>Information, Vol. 17, Pages 440: Quantitative Analysis of Information Security and Privacy Challenges in Government Cloud Service Adoption</title>
	<link>https://www.mdpi.com/2078-2489/17/5/440</link>
	<description>The government&amp;amp;rsquo;s adoption of cloud computing is critical for digital transformation, but it faces persistent concerns over information security, privacy, governance, and risk. This study examines the factors influencing a government&amp;amp;rsquo;s intention to adopt cloud services, adapting the Unified Theory of Acceptance and Use of Technology (UTAUT) with constructs tailored to the public sector. A cross-sectional survey was conducted across 90 Nigerian government organisations, producing 230 valid responses from IT professionals, administrators, and policy personnel. The statistical analysis of the data was conducted using SPSS and structural equation modelling in AMOS. Validity and reliability were confirmed through composite reliability, Cronbach&amp;amp;rsquo;s alpha, and discriminant validity measures. Findings show that privacy (&amp;amp;beta; = 0.11, p &amp;amp;lt; 0.05), governance framework (&amp;amp;beta; = 0.34, p &amp;amp;lt; 0.001), performance expectancy (&amp;amp;beta; = 0.38, p &amp;amp;lt; 0.001), and information security (&amp;amp;beta; = 0.10, p &amp;amp;lt; 0.05) significantly influence government intention to adopt cloud services. Performance expectancy emerged as the strongest predictor. Contrary to expectations, perceived risk did not significantly moderate the relationships, and interaction terms were non-significant. The final model explained 45% of the variance in adoption intention (R2 = 0.45). The study highlights the importance of strengthening governance frameworks, emphasising tangible performance outcomes, and positioning information security and privacy as an enabler of adoption rather than a barrier. By adapting UTAUT to the government context and disentangling the role of perceived risk, the study offers both theoretical refinement and practical guidance for policymakers aiming to accelerate digital transformation and secure cloud adoption.</description>
	<pubDate>2026-05-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 440: Quantitative Analysis of Information Security and Privacy Challenges in Government Cloud Service Adoption</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/440">doi: 10.3390/info17050440</a></p>
	<p>Authors:
		Ndukwe Ukeje
		Jairo A. Gutierrez
		Krassie Petrova
		</p>
	<p>The government&amp;amp;rsquo;s adoption of cloud computing is critical for digital transformation, but it faces persistent concerns over information security, privacy, governance, and risk. This study examines the factors influencing a government&amp;amp;rsquo;s intention to adopt cloud services, adapting the Unified Theory of Acceptance and Use of Technology (UTAUT) with constructs tailored to the public sector. A cross-sectional survey was conducted across 90 Nigerian government organisations, producing 230 valid responses from IT professionals, administrators, and policy personnel. The statistical analysis of the data was conducted using SPSS and structural equation modelling in AMOS. Validity and reliability were confirmed through composite reliability, Cronbach&amp;amp;rsquo;s alpha, and discriminant validity measures. Findings show that privacy (&amp;amp;beta; = 0.11, p &amp;amp;lt; 0.05), governance framework (&amp;amp;beta; = 0.34, p &amp;amp;lt; 0.001), performance expectancy (&amp;amp;beta; = 0.38, p &amp;amp;lt; 0.001), and information security (&amp;amp;beta; = 0.10, p &amp;amp;lt; 0.05) significantly influence government intention to adopt cloud services. Performance expectancy emerged as the strongest predictor. Contrary to expectations, perceived risk did not significantly moderate the relationships, and interaction terms were non-significant. The final model explained 45% of the variance in adoption intention (R2 = 0.45). The study highlights the importance of strengthening governance frameworks, emphasising tangible performance outcomes, and positioning information security and privacy as an enabler of adoption rather than a barrier. By adapting UTAUT to the government context and disentangling the role of perceived risk, the study offers both theoretical refinement and practical guidance for policymakers aiming to accelerate digital transformation and secure cloud adoption.</p>
	]]></content:encoded>

	<dc:title>Quantitative Analysis of Information Security and Privacy Challenges in Government Cloud Service Adoption</dc:title>
			<dc:creator>Ndukwe Ukeje</dc:creator>
			<dc:creator>Jairo A. Gutierrez</dc:creator>
			<dc:creator>Krassie Petrova</dc:creator>
		<dc:identifier>doi: 10.3390/info17050440</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-02</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-02</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>440</prism:startingPage>
		<prism:doi>10.3390/info17050440</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/440</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/439">

	<title>Information, Vol. 17, Pages 439: Perceived Risk and Trust Towards Health Chatbots: Extending TAM with Self-Efficacy</title>
	<link>https://www.mdpi.com/2078-2489/17/5/439</link>
	<description>Health chatbots have been growing into a necessary tool for dealing with risky and important contexts, such as medical and health information seeking. Meanwhile, trust towards chatbots influences people&amp;amp;rsquo;s willingness to embrace technology and use it consistently. Thus, it is important to explore the mechanism of forming trust towards the health chatbots. The TAM has been introduced to explain the mechanism. This study extends the TAM framework by incorporating perceived risk and self-efficacy to develop an expanded model that explains the mechanisms underlying trust formation in health chatbots, applying a survey and investigating 480 Chinese chatbot users on the Credamo. The findings show that perceived risk reduces trust both directly and indirectly through perceived usefulness, perceived ease of use, and self-efficacy. Both parallel and serial mediation pathways were supported. These results offer a more complete insight into trust formation in high-risk AI contexts and provide practical guidance for chatbot design and governance in health communication.</description>
	<pubDate>2026-05-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 439: Perceived Risk and Trust Towards Health Chatbots: Extending TAM with Self-Efficacy</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/439">doi: 10.3390/info17050439</a></p>
	<p>Authors:
		Le Song
		Jie Liu
		Maizura Yasin
		Marzni Mohamed Mokhtar
		</p>
	<p>Health chatbots have been growing into a necessary tool for dealing with risky and important contexts, such as medical and health information seeking. Meanwhile, trust towards chatbots influences people&amp;amp;rsquo;s willingness to embrace technology and use it consistently. Thus, it is important to explore the mechanism of forming trust towards the health chatbots. The TAM has been introduced to explain the mechanism. This study extends the TAM framework by incorporating perceived risk and self-efficacy to develop an expanded model that explains the mechanisms underlying trust formation in health chatbots, applying a survey and investigating 480 Chinese chatbot users on the Credamo. The findings show that perceived risk reduces trust both directly and indirectly through perceived usefulness, perceived ease of use, and self-efficacy. Both parallel and serial mediation pathways were supported. These results offer a more complete insight into trust formation in high-risk AI contexts and provide practical guidance for chatbot design and governance in health communication.</p>
	]]></content:encoded>

	<dc:title>Perceived Risk and Trust Towards Health Chatbots: Extending TAM with Self-Efficacy</dc:title>
			<dc:creator>Le Song</dc:creator>
			<dc:creator>Jie Liu</dc:creator>
			<dc:creator>Maizura Yasin</dc:creator>
			<dc:creator>Marzni Mohamed Mokhtar</dc:creator>
		<dc:identifier>doi: 10.3390/info17050439</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-02</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-02</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>439</prism:startingPage>
		<prism:doi>10.3390/info17050439</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/439</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/438">

	<title>Information, Vol. 17, Pages 438: Defining an Ethical Explainability Metric for Measuring AI Trustworthiness in Connected Healthcare Systems</title>
	<link>https://www.mdpi.com/2078-2489/17/5/438</link>
	<description>Leveraging Artificial Intelligence (AI) ethically in connected healthcare systems requires a quantifiable framework that measures not only outcome correctness, but also the clarity, auditability, and ethical acceptability of model explanations in high-stakes clinical and cybersecurity workflows. This manuscript first presents a narrative review of ethical risks and countermeasures in Healthcare Internet of Things (HIoT) and explains why existing performance metrics are insufficient for trustworthy deployment. We then formalize a quantitative metric called Ethical Explainability (Ee) as a composite index integrating (1) a Human Agreement Ratio (HAR), capturing concordance between AI recommendations (and their rationale) and a calibrated expert consensus, and (2) an Entropy Reduction Index (ERI), capturing the proportional reduction in expert uncertainty after receiving an explanation, operationalized via probability-elicitation questionnaires mapped to Shannon entropy. Designed for HIoT security monitoring, Ee links transparency with governance-ready evidence of trustworthiness for human&amp;amp;ndash;AI collaboration.</description>
	<pubDate>2026-05-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 438: Defining an Ethical Explainability Metric for Measuring AI Trustworthiness in Connected Healthcare Systems</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/438">doi: 10.3390/info17050438</a></p>
	<p>Authors:
		Parul Naib
		Jaeyoung Park
		Paniz Abedin
		Christian King
		Varadraj Gurupur
		</p>
	<p>Leveraging Artificial Intelligence (AI) ethically in connected healthcare systems requires a quantifiable framework that measures not only outcome correctness, but also the clarity, auditability, and ethical acceptability of model explanations in high-stakes clinical and cybersecurity workflows. This manuscript first presents a narrative review of ethical risks and countermeasures in Healthcare Internet of Things (HIoT) and explains why existing performance metrics are insufficient for trustworthy deployment. We then formalize a quantitative metric called Ethical Explainability (Ee) as a composite index integrating (1) a Human Agreement Ratio (HAR), capturing concordance between AI recommendations (and their rationale) and a calibrated expert consensus, and (2) an Entropy Reduction Index (ERI), capturing the proportional reduction in expert uncertainty after receiving an explanation, operationalized via probability-elicitation questionnaires mapped to Shannon entropy. Designed for HIoT security monitoring, Ee links transparency with governance-ready evidence of trustworthiness for human&amp;amp;ndash;AI collaboration.</p>
	]]></content:encoded>

	<dc:title>Defining an Ethical Explainability Metric for Measuring AI Trustworthiness in Connected Healthcare Systems</dc:title>
			<dc:creator>Parul Naib</dc:creator>
			<dc:creator>Jaeyoung Park</dc:creator>
			<dc:creator>Paniz Abedin</dc:creator>
			<dc:creator>Christian King</dc:creator>
			<dc:creator>Varadraj Gurupur</dc:creator>
		<dc:identifier>doi: 10.3390/info17050438</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-02</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-02</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>438</prism:startingPage>
		<prism:doi>10.3390/info17050438</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/438</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/434">

	<title>Information, Vol. 17, Pages 434: Crying Wolf in Cyberspace: A Cybersecurity Dynamics Study of Alarm Fatigue Attacks</title>
	<link>https://www.mdpi.com/2078-2489/17/5/434</link>
	<description>Modern cyber&amp;amp;ndash;physical infrastructures rely heavily on alarm and notification systems to direct human attention when abnormal conditions occur. These mechanisms support timely and safe responses by informing operators and occupants about potential hazards. At the same time, research in human factors has shown that repeated or excessive alerts can weaken vigilance, slow reactions, and reduce confidence in warning systems. This behavioral pattern is commonly described as alarm fatigue. This paper examines how that vulnerability can be exploited intentionally. We refer to this adversarial strategy as alarm poisoning: the deliberate injection of false or misleading alerts in order to increase alarm pressure, erode trust in the monitoring infrastructure, and degrade organizational responsiveness over time. To study this process, we develop a stochastic Cybersecurity Dynamics model representing the interaction among attackers, defenders, alarm infrastructure, and a population of employees. Employee behavior is modeled through evolving trust and fatigue levels, while the overall system is formulated as a continuous&amp;amp;ndash;time Markov chain and simulated using the Gillespie Stochastic Simulation Algorithm. A Monte&amp;amp;ndash;Carlo campaign is used to analyze the resulting socio&amp;amp;ndash;technical dynamics under alternative attacker strategies. The study evaluates time-dependent trust, fatigue, and alarm-pressure trajectories, the distribution of times to behavioral collapse, and defender timing through Trust&amp;amp;ndash;Resilience&amp;amp;ndash;Agility&amp;amp;ndash;Mitigation (TRAM) metrics. The revised analysis also includes replication-sufficiency diagnostics, one-at-a-time sensitivity analysis, and threshold-robustness checks for the collapse criterion. The results show that false alarms with high perceived severity drive alarm pressure upward and degrade trust faster than nuisance-dominated campaigns, even when the total fake-alarm intensity is held constant across strategies. Collapse timing remains highly variable across stochastic realizations, and a non-negligible fraction of runs do not reach the collapse threshold within the simulation horizon. Sensitivity analysis indicates that the main qualitative ranking of attacker strategies is robust across most tested perturbations, with fatigue recovery and defender escalation emerging as particularly influential mechanisms. Overall, the findings support the view that alarm poisoning is a credible socio&amp;amp;ndash;technical attack vector and highlight the importance of rapid mitigation, robust alarm management, and human-centered defensive design in cyber&amp;amp;ndash;physical security systems.</description>
	<pubDate>2026-05-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 434: Crying Wolf in Cyberspace: A Cybersecurity Dynamics Study of Alarm Fatigue Attacks</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/434">doi: 10.3390/info17050434</a></p>
	<p>Authors:
		Enrico Barbierato
		</p>
	<p>Modern cyber&amp;amp;ndash;physical infrastructures rely heavily on alarm and notification systems to direct human attention when abnormal conditions occur. These mechanisms support timely and safe responses by informing operators and occupants about potential hazards. At the same time, research in human factors has shown that repeated or excessive alerts can weaken vigilance, slow reactions, and reduce confidence in warning systems. This behavioral pattern is commonly described as alarm fatigue. This paper examines how that vulnerability can be exploited intentionally. We refer to this adversarial strategy as alarm poisoning: the deliberate injection of false or misleading alerts in order to increase alarm pressure, erode trust in the monitoring infrastructure, and degrade organizational responsiveness over time. To study this process, we develop a stochastic Cybersecurity Dynamics model representing the interaction among attackers, defenders, alarm infrastructure, and a population of employees. Employee behavior is modeled through evolving trust and fatigue levels, while the overall system is formulated as a continuous&amp;amp;ndash;time Markov chain and simulated using the Gillespie Stochastic Simulation Algorithm. A Monte&amp;amp;ndash;Carlo campaign is used to analyze the resulting socio&amp;amp;ndash;technical dynamics under alternative attacker strategies. The study evaluates time-dependent trust, fatigue, and alarm-pressure trajectories, the distribution of times to behavioral collapse, and defender timing through Trust&amp;amp;ndash;Resilience&amp;amp;ndash;Agility&amp;amp;ndash;Mitigation (TRAM) metrics. The revised analysis also includes replication-sufficiency diagnostics, one-at-a-time sensitivity analysis, and threshold-robustness checks for the collapse criterion. The results show that false alarms with high perceived severity drive alarm pressure upward and degrade trust faster than nuisance-dominated campaigns, even when the total fake-alarm intensity is held constant across strategies. Collapse timing remains highly variable across stochastic realizations, and a non-negligible fraction of runs do not reach the collapse threshold within the simulation horizon. Sensitivity analysis indicates that the main qualitative ranking of attacker strategies is robust across most tested perturbations, with fatigue recovery and defender escalation emerging as particularly influential mechanisms. Overall, the findings support the view that alarm poisoning is a credible socio&amp;amp;ndash;technical attack vector and highlight the importance of rapid mitigation, robust alarm management, and human-centered defensive design in cyber&amp;amp;ndash;physical security systems.</p>
	]]></content:encoded>

	<dc:title>Crying Wolf in Cyberspace: A Cybersecurity Dynamics Study of Alarm Fatigue Attacks</dc:title>
			<dc:creator>Enrico Barbierato</dc:creator>
		<dc:identifier>doi: 10.3390/info17050434</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>434</prism:startingPage>
		<prism:doi>10.3390/info17050434</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/434</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/437">

	<title>Information, Vol. 17, Pages 437: A Hybrid Recommendation Approach for Adaptive Worksheet Generation Using Pedagogically Structured Learning Objects</title>
	<link>https://www.mdpi.com/2078-2489/17/5/437</link>
	<description>Adaptive recommendation mechanisms are widely used to personalise digital learning environments; however, many existing approaches prioritise algorithmic optimisation while providing limited insight into how recommendation behaviour aligns with pedagogically structured instructional artefacts, such as worksheets. To address this gap, this paper proposes a hybrid recommendation approach for adaptive worksheet generation that integrates content-based and collaborative filtering with explicit pedagogical constraints derived from Bloom&amp;amp;rsquo;s Revised Taxonomy. The system ranks and selects learning and evaluation objects across cognitive levels by combining learner profiles, behavioural signals, and similarity-based information within a unified scoring framework. A simulation-based evaluation was conducted to examine the internal behaviour, stability, and instructional alignment of the recommendation engine under controlled conditions, using Bloom-aligned worksheets and synthetic learner profiles. The analysis focuses on expected&amp;amp;ndash;actual alignment and adaptive variation across cognitive levels rather than learning outcomes. Results indicate strong alignment with the intended instructional structure at lower cognitive levels, while bounded and interpretable adaptive variation emerges at higher levels. Evaluation object recommendations showed high agreement with the instructional design, exceeding 95% across simulated conditions. Overall, the study demonstrates how hybrid recommendation mechanisms can support adaptive content selection in pedagogically structured learning scenarios, offering a transparent and robust foundation for information-driven educational systems.</description>
	<pubDate>2026-05-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 437: A Hybrid Recommendation Approach for Adaptive Worksheet Generation Using Pedagogically Structured Learning Objects</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/437">doi: 10.3390/info17050437</a></p>
	<p>Authors:
		Iraklis Katsaris
		Sakellaris Sfakiotakis
		Ilias Logothetis
		Nikolas Vidakis
		</p>
	<p>Adaptive recommendation mechanisms are widely used to personalise digital learning environments; however, many existing approaches prioritise algorithmic optimisation while providing limited insight into how recommendation behaviour aligns with pedagogically structured instructional artefacts, such as worksheets. To address this gap, this paper proposes a hybrid recommendation approach for adaptive worksheet generation that integrates content-based and collaborative filtering with explicit pedagogical constraints derived from Bloom&amp;amp;rsquo;s Revised Taxonomy. The system ranks and selects learning and evaluation objects across cognitive levels by combining learner profiles, behavioural signals, and similarity-based information within a unified scoring framework. A simulation-based evaluation was conducted to examine the internal behaviour, stability, and instructional alignment of the recommendation engine under controlled conditions, using Bloom-aligned worksheets and synthetic learner profiles. The analysis focuses on expected&amp;amp;ndash;actual alignment and adaptive variation across cognitive levels rather than learning outcomes. Results indicate strong alignment with the intended instructional structure at lower cognitive levels, while bounded and interpretable adaptive variation emerges at higher levels. Evaluation object recommendations showed high agreement with the instructional design, exceeding 95% across simulated conditions. Overall, the study demonstrates how hybrid recommendation mechanisms can support adaptive content selection in pedagogically structured learning scenarios, offering a transparent and robust foundation for information-driven educational systems.</p>
	]]></content:encoded>

	<dc:title>A Hybrid Recommendation Approach for Adaptive Worksheet Generation Using Pedagogically Structured Learning Objects</dc:title>
			<dc:creator>Iraklis Katsaris</dc:creator>
			<dc:creator>Sakellaris Sfakiotakis</dc:creator>
			<dc:creator>Ilias Logothetis</dc:creator>
			<dc:creator>Nikolas Vidakis</dc:creator>
		<dc:identifier>doi: 10.3390/info17050437</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>437</prism:startingPage>
		<prism:doi>10.3390/info17050437</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/437</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/435">

	<title>Information, Vol. 17, Pages 435: Integrating Risk Factors and Symptoms for Urinary Tract Infection Diagnosis Using an Explainable AI Approach in Low-Resource Regions</title>
	<link>https://www.mdpi.com/2078-2489/17/5/435</link>
	<description>Urinary Tract Infections (UTIs) represent one of the most prevalent bacterial infections globally, posing significant health burdens, especially in low- and middle-income countries (LMICs), due to delayed diagnoses, limited access to laboratory services, and rising antimicrobial resistance. This study presents a machine learning (ML)-based diagnostic support framework for early UTI detection, leveraging structured clinical data and explainable artificial intelligence (XAI) techniques to enhance interpretability and trust among healthcare providers. A patient dataset containing 4865 records was used in the study to train and test Extreme Gradient Boosting (XGBoost), Decision Tree (DT) and Random Forest (RF) classifiers, while class imbalance was addressed using Synthetic Minority Over-sampling Technique (SMOTE). The performance of the models was evaluated through accuracy, precision, recall, F1-score, Log Loss, and AUC-ROC, and random forest showed the best results (accuracy: 86.43%, F1-score: 86.71%, AUC-ROC: 0.8695). To ensure that such models can be adopted by stakeholders in the health sector, Local Interpret-able Model-agnostic Explanations (LIME) were integrated, which identified painful urination, urinary frequency, and suprapubic pain as primary predictors in the model. This study shows that interpretable ML models can be helpful in resource-limited regions in predicting UTIs, thereby rendering a solution to improve the management of infections in these regions.</description>
	<pubDate>2026-05-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 435: Integrating Risk Factors and Symptoms for Urinary Tract Infection Diagnosis Using an Explainable AI Approach in Low-Resource Regions</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/435">doi: 10.3390/info17050435</a></p>
	<p>Authors:
		Kingsley Attai
		Daniel Asuquo
		Kingsley Akputu
		Okure Obot
		Cornelia Thomas
		Faith-Valentine Uzoka
		Ekerette Attai
		Christie Akwaowo
		Faith-Michael Uzoka
		</p>
	<p>Urinary Tract Infections (UTIs) represent one of the most prevalent bacterial infections globally, posing significant health burdens, especially in low- and middle-income countries (LMICs), due to delayed diagnoses, limited access to laboratory services, and rising antimicrobial resistance. This study presents a machine learning (ML)-based diagnostic support framework for early UTI detection, leveraging structured clinical data and explainable artificial intelligence (XAI) techniques to enhance interpretability and trust among healthcare providers. A patient dataset containing 4865 records was used in the study to train and test Extreme Gradient Boosting (XGBoost), Decision Tree (DT) and Random Forest (RF) classifiers, while class imbalance was addressed using Synthetic Minority Over-sampling Technique (SMOTE). The performance of the models was evaluated through accuracy, precision, recall, F1-score, Log Loss, and AUC-ROC, and random forest showed the best results (accuracy: 86.43%, F1-score: 86.71%, AUC-ROC: 0.8695). To ensure that such models can be adopted by stakeholders in the health sector, Local Interpret-able Model-agnostic Explanations (LIME) were integrated, which identified painful urination, urinary frequency, and suprapubic pain as primary predictors in the model. This study shows that interpretable ML models can be helpful in resource-limited regions in predicting UTIs, thereby rendering a solution to improve the management of infections in these regions.</p>
	]]></content:encoded>

	<dc:title>Integrating Risk Factors and Symptoms for Urinary Tract Infection Diagnosis Using an Explainable AI Approach in Low-Resource Regions</dc:title>
			<dc:creator>Kingsley Attai</dc:creator>
			<dc:creator>Daniel Asuquo</dc:creator>
			<dc:creator>Kingsley Akputu</dc:creator>
			<dc:creator>Okure Obot</dc:creator>
			<dc:creator>Cornelia Thomas</dc:creator>
			<dc:creator>Faith-Valentine Uzoka</dc:creator>
			<dc:creator>Ekerette Attai</dc:creator>
			<dc:creator>Christie Akwaowo</dc:creator>
			<dc:creator>Faith-Michael Uzoka</dc:creator>
		<dc:identifier>doi: 10.3390/info17050435</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>435</prism:startingPage>
		<prism:doi>10.3390/info17050435</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/435</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/5/436">

	<title>Information, Vol. 17, Pages 436: Parallel concatenated block codes with flexible lengths and near-optimum performance</title>
	<link>https://www.mdpi.com/2078-2489/17/5/436</link>
	<description>The paper presents a modification of the interleaver used to construct Parallel Concatenated Block (PCB) codes with flexible lengths. This is accomplished for PCB codes whose interleaved message blocks have at most two bits of a message block. For this purpose, a two-step permutation is implemented, ensuring that the minimum weight of PCB codes has low multiplicity and is obtained from messages with weight one. Conducted analysis and simulations confirm that the new interleaver improves the performance of the PCB code (by 0.25 dB), which is evident at medium to high signal-to-noise ratios. Such improvement is evident for long-length PCB codes.</description>
	<pubDate>2026-05-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 436: Parallel concatenated block codes with flexible lengths and near-optimum performance</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/5/436">doi: 10.3390/info17050436</a></p>
	<p>Authors:
		Vijayasri Sundarapuram Soundayan
		Sina Vafi
		</p>
	<p>The paper presents a modification of the interleaver used to construct Parallel Concatenated Block (PCB) codes with flexible lengths. This is accomplished for PCB codes whose interleaved message blocks have at most two bits of a message block. For this purpose, a two-step permutation is implemented, ensuring that the minimum weight of PCB codes has low multiplicity and is obtained from messages with weight one. Conducted analysis and simulations confirm that the new interleaver improves the performance of the PCB code (by 0.25 dB), which is evident at medium to high signal-to-noise ratios. Such improvement is evident for long-length PCB codes.</p>
	]]></content:encoded>

	<dc:title>Parallel concatenated block codes with flexible lengths and near-optimum performance</dc:title>
			<dc:creator>Vijayasri Sundarapuram Soundayan</dc:creator>
			<dc:creator>Sina Vafi</dc:creator>
		<dc:identifier>doi: 10.3390/info17050436</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-05-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-05-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>5</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>436</prism:startingPage>
		<prism:doi>10.3390/info17050436</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/5/436</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
    
<cc:License rdf:about="https://creativecommons.org/licenses/by/4.0/">
	<cc:permits rdf:resource="https://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="https://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
