<?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?1786364601"/>
				<items>
			<rdf:Seq>
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/770" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/769" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/768" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/767" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/766" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/765" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/764" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/763" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/762" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/761" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/760" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/759" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/758" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/757" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/756" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/755" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/754" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/753" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/752" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/751" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/750" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/749" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/748" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/747" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/746" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/745" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/744" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/743" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/742" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/741" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/740" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/739" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/738" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/737" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/736" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/735" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/734" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/733" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/732" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/731" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/730" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/729" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/728" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/727" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/726" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/725" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/724" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/723" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/722" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/721" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/720" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/719" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/718" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/717" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/8/716" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/715" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/714" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/713" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/712" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/711" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/710" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/709" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/708" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/707" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/706" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/705" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/704" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/703" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/702" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/701" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/700" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/699" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/698" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/697" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/696" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/695" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/692" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/694" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/693" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/691" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/690" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/689" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/688" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/687" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/686" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/685" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/684" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/683" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/682" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/681" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/680" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/678" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/679" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/677" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/676" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/675" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/674" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/673" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/672" />
            				<rdf:li rdf:resource="https://www.mdpi.com/2078-2489/17/7/671" />
                    	</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/8/770">

	<title>Information, Vol. 17, Pages 770: AI Assistants Based on Large Language Models for Adolescent Health and Well-Being: A Systematic Review</title>
	<link>https://www.mdpi.com/2078-2489/17/8/770</link>
	<description>Objective: Large Language Models (LLMs) are emerging as a key component for digital health systems based on Artificial Intelligence (AI). The objective of this paper is to systematically review the characteristics, effectiveness, and implementation challenges of LLM-based assistants targeting adolescent health and well-being. Methods: A systematic review was conducted following the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) 2020 guidelines. PubMed, Scopus, and Web of Science were searched in November 2025 for studies published from 2022 onwards. Eligible studies examined LLM-based assistants used directly by adolescents in health and well-being contexts and reported quantitative outcomes. Data was extracted independently by multiple reviewers and synthesised narratively. Risk of bias was assessed using the Mixed Methods Appraisal Tool (MMAT). Results: Nine studies met the inclusion criteria, involving between 3 and 40 participants and covering mental health support, physical activity promotion, treatment engagement, vaccination awareness, and academic self-efficacy. Most studies were proof-of-concept investigations or pilot studies. LLM-based assistants were associated with reductions in depression, anxiety, stress, and negative affect, improvements in emotional regulation, physical activity, treatment motivation, HPV knowledge, and academic self-efficacy. Risk of bias was generally moderate and the evidence base was limited by small samples, short follow-up periods, and heterogeneous methodologies. Conclusions: LLM-based assistants show promise as scalable and accessible tools for supporting adolescent health and well-being, particularly in mental health domains. However, the current evidence remains preliminary. Larger, long-term, and rigorously designed studies are required to establish effectiveness, safety, and implementation feasibility. Registration: This review was not pre-registered and no review protocol has been published prior to conducting the review.</description>
	<pubDate>2026-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 770: AI Assistants Based on Large Language Models for Adolescent Health and Well-Being: A Systematic Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/770">doi: 10.3390/info17080770</a></p>
	<p>Authors:
		Andreas Triantafyllidis
		Sofia Segkouli
		Evdoxia Eirini Lithoxoidou
		Anastasios Alexiadis
		Konstantinos Votis
		Kleio Koutra
		Vassilis Kilintzis
		Haridimos Kondylakis
		Eunate Arana-Arri
		Severin Haug
		Nikolaos Boumparis
		Maria Krini
		Liselot Hudders
		Dimitrios Tzovaras
		</p>
	<p>Objective: Large Language Models (LLMs) are emerging as a key component for digital health systems based on Artificial Intelligence (AI). The objective of this paper is to systematically review the characteristics, effectiveness, and implementation challenges of LLM-based assistants targeting adolescent health and well-being. Methods: A systematic review was conducted following the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) 2020 guidelines. PubMed, Scopus, and Web of Science were searched in November 2025 for studies published from 2022 onwards. Eligible studies examined LLM-based assistants used directly by adolescents in health and well-being contexts and reported quantitative outcomes. Data was extracted independently by multiple reviewers and synthesised narratively. Risk of bias was assessed using the Mixed Methods Appraisal Tool (MMAT). Results: Nine studies met the inclusion criteria, involving between 3 and 40 participants and covering mental health support, physical activity promotion, treatment engagement, vaccination awareness, and academic self-efficacy. Most studies were proof-of-concept investigations or pilot studies. LLM-based assistants were associated with reductions in depression, anxiety, stress, and negative affect, improvements in emotional regulation, physical activity, treatment motivation, HPV knowledge, and academic self-efficacy. Risk of bias was generally moderate and the evidence base was limited by small samples, short follow-up periods, and heterogeneous methodologies. Conclusions: LLM-based assistants show promise as scalable and accessible tools for supporting adolescent health and well-being, particularly in mental health domains. However, the current evidence remains preliminary. Larger, long-term, and rigorously designed studies are required to establish effectiveness, safety, and implementation feasibility. Registration: This review was not pre-registered and no review protocol has been published prior to conducting the review.</p>
	]]></content:encoded>

	<dc:title>AI Assistants Based on Large Language Models for Adolescent Health and Well-Being: A Systematic Review</dc:title>
			<dc:creator>Andreas Triantafyllidis</dc:creator>
			<dc:creator>Sofia Segkouli</dc:creator>
			<dc:creator>Evdoxia Eirini Lithoxoidou</dc:creator>
			<dc:creator>Anastasios Alexiadis</dc:creator>
			<dc:creator>Konstantinos Votis</dc:creator>
			<dc:creator>Kleio Koutra</dc:creator>
			<dc:creator>Vassilis Kilintzis</dc:creator>
			<dc:creator>Haridimos Kondylakis</dc:creator>
			<dc:creator>Eunate Arana-Arri</dc:creator>
			<dc:creator>Severin Haug</dc:creator>
			<dc:creator>Nikolaos Boumparis</dc:creator>
			<dc:creator>Maria Krini</dc:creator>
			<dc:creator>Liselot Hudders</dc:creator>
			<dc:creator>Dimitrios Tzovaras</dc:creator>
		<dc:identifier>doi: 10.3390/info17080770</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Systematic Review</prism:section>
	<prism:startingPage>770</prism:startingPage>
		<prism:doi>10.3390/info17080770</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/770</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/769">

	<title>Information, Vol. 17, Pages 769: Security Analysis of Temporal Convolutional Network-Based Side-Channel Attacks for AES Cryptographic Implementations</title>
	<link>https://www.mdpi.com/2078-2489/17/8/769</link>
	<description>Profiling side-channel attacks based on deep learning can recover cryptographic information from power-consumption traces, but their effectiveness may be reduced when desynchronisation displaces informative leakage across temporal positions. This study investigates whether Temporal Convolutional Networks (TCNs) can model the local and long-range dependencies present in desynchronised traces. Three complementary TCN variants are designed to isolate different temporal modelling strategies: a single-kernel dilated architecture (TCN1), a multi-scale architecture using parallel kernel sizes (TCN2), and a residual architecture intended to support stable hierarchical feature learning (TCN3). The models are evaluated on the ASCAD v1 fixed-key benchmark under synchronised conditions and maximum temporal shifts of 25, 50, and 75 samples, using validation loss and complementary key-ranking metrics. Under the most challenging setting, TCN1 achieves the highest Rank Success Rate and reaches its best rank substantially earlier than the conventional CNN baselines, although the lowest Final Rank is obtained by a CNN. These results indicate that TCN1 provides the most favourable trade-off among convergence speed, ranking consistency, and architectural complexity, without establishing uniform TCN superiority across all metrics. Gradient saliency, LIME, and occlusion analyses further identify temporal regions that influence the model predictions and are consistent with expected leakage patterns. The main contribution is a controlled comparison of complementary TCN design strategies, combined with an explainability analysis, for profiling side-channel attacks under trace desynchronisation.</description>
	<pubDate>2026-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 769: Security Analysis of Temporal Convolutional Network-Based Side-Channel Attacks for AES Cryptographic Implementations</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/769">doi: 10.3390/info17080769</a></p>
	<p>Authors:
		Francesco Benedetto
		Federica Massimi
		</p>
	<p>Profiling side-channel attacks based on deep learning can recover cryptographic information from power-consumption traces, but their effectiveness may be reduced when desynchronisation displaces informative leakage across temporal positions. This study investigates whether Temporal Convolutional Networks (TCNs) can model the local and long-range dependencies present in desynchronised traces. Three complementary TCN variants are designed to isolate different temporal modelling strategies: a single-kernel dilated architecture (TCN1), a multi-scale architecture using parallel kernel sizes (TCN2), and a residual architecture intended to support stable hierarchical feature learning (TCN3). The models are evaluated on the ASCAD v1 fixed-key benchmark under synchronised conditions and maximum temporal shifts of 25, 50, and 75 samples, using validation loss and complementary key-ranking metrics. Under the most challenging setting, TCN1 achieves the highest Rank Success Rate and reaches its best rank substantially earlier than the conventional CNN baselines, although the lowest Final Rank is obtained by a CNN. These results indicate that TCN1 provides the most favourable trade-off among convergence speed, ranking consistency, and architectural complexity, without establishing uniform TCN superiority across all metrics. Gradient saliency, LIME, and occlusion analyses further identify temporal regions that influence the model predictions and are consistent with expected leakage patterns. The main contribution is a controlled comparison of complementary TCN design strategies, combined with an explainability analysis, for profiling side-channel attacks under trace desynchronisation.</p>
	]]></content:encoded>

	<dc:title>Security Analysis of Temporal Convolutional Network-Based Side-Channel Attacks for AES Cryptographic Implementations</dc:title>
			<dc:creator>Francesco Benedetto</dc:creator>
			<dc:creator>Federica Massimi</dc:creator>
		<dc:identifier>doi: 10.3390/info17080769</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>769</prism:startingPage>
		<prism:doi>10.3390/info17080769</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/769</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/768">

	<title>Information, Vol. 17, Pages 768: Preference Learning and Hybrid Combinatorial Optimization for Intelligent Group-Buying Platforms: A Prototype-Calibrated Study of SmartBuy Connect</title>
	<link>https://www.mdpi.com/2078-2489/17/8/768</link>
	<description>Group-buying platforms require the joint treatment of individual user relevance and hard operational constraints, including minimum group size, lot capacity, spending limits, product availability, and simultaneous participation limits. This paper presents Preference-Aware Hybrid Combinatorial Group Optimization (PA-HCGO), a prototype-calibrated decision framework that integrates implicit feedback preference learning with constrained user&amp;amp;ndash;lot assignment. The contribution is not a new recommender architecture or a new integer programming solver, but a system-level integration of learned user&amp;amp;ndash;lot utility and hard group-buying feasibility constraints inside the SmartBuy Connect prototype. The empirical part uses an anonymized prototype dataset containing 200 products, 150 users, 150 lots, 4000 user events, and 500 orders. The evaluation is explicitly divided into three tracks: observed temporal recommendation testing, a calibrated counterfactual pre-activation scenario, and synthetic scalability tests generated from prototype-calibrated distributions. In the observed transactional test subset, which contains 40 held-out transactional items from 36 users, the PA-PREF preference layer achieved Recall@10 = 0.3611 and NDCG@10 = 0.1319 using user&amp;amp;ndash;category profiles available at the end of the training interval. Although PA-PREF obtained the highest point estimate, its advantage over the content-only baseline was not statistically separable at the 95% level on this small transactional subset. The result is therefore treated as preliminary. For general engagement, the popularity baseline remained stronger, indicating that the proposed preference model is more useful for transactional intent prediction than for all activity types. In the calibrated counterfactual pre-activation scenario, PA-HCGO activated 117 of 150 lots, compared with 85 lots under independent greedy assignment. This scenario is a constructed pre-activation setting rather than an observed historical platform state. In synthetic scalability tests, the method remained computationally feasible up to 5000 users and 1000 lots, with a mean solve time of 4.7174 s in the prototype implementation. The results suggest that learned user&amp;amp;ndash;lot utility can improve constrained group formation, but the evidence should be interpreted as prototype-calibrated rather than as proof of industrial-scale business effectiveness.</description>
	<pubDate>2026-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 768: Preference Learning and Hybrid Combinatorial Optimization for Intelligent Group-Buying Platforms: A Prototype-Calibrated Study of SmartBuy Connect</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/768">doi: 10.3390/info17080768</a></p>
	<p>Authors:
		Aizhan Kassymova
		Raissa Uskenbayeva
		Young Im Cho
		Venera Elle
		Aizhan Anartayeva
		Aizhan Smakhanova
		</p>
	<p>Group-buying platforms require the joint treatment of individual user relevance and hard operational constraints, including minimum group size, lot capacity, spending limits, product availability, and simultaneous participation limits. This paper presents Preference-Aware Hybrid Combinatorial Group Optimization (PA-HCGO), a prototype-calibrated decision framework that integrates implicit feedback preference learning with constrained user&amp;amp;ndash;lot assignment. The contribution is not a new recommender architecture or a new integer programming solver, but a system-level integration of learned user&amp;amp;ndash;lot utility and hard group-buying feasibility constraints inside the SmartBuy Connect prototype. The empirical part uses an anonymized prototype dataset containing 200 products, 150 users, 150 lots, 4000 user events, and 500 orders. The evaluation is explicitly divided into three tracks: observed temporal recommendation testing, a calibrated counterfactual pre-activation scenario, and synthetic scalability tests generated from prototype-calibrated distributions. In the observed transactional test subset, which contains 40 held-out transactional items from 36 users, the PA-PREF preference layer achieved Recall@10 = 0.3611 and NDCG@10 = 0.1319 using user&amp;amp;ndash;category profiles available at the end of the training interval. Although PA-PREF obtained the highest point estimate, its advantage over the content-only baseline was not statistically separable at the 95% level on this small transactional subset. The result is therefore treated as preliminary. For general engagement, the popularity baseline remained stronger, indicating that the proposed preference model is more useful for transactional intent prediction than for all activity types. In the calibrated counterfactual pre-activation scenario, PA-HCGO activated 117 of 150 lots, compared with 85 lots under independent greedy assignment. This scenario is a constructed pre-activation setting rather than an observed historical platform state. In synthetic scalability tests, the method remained computationally feasible up to 5000 users and 1000 lots, with a mean solve time of 4.7174 s in the prototype implementation. The results suggest that learned user&amp;amp;ndash;lot utility can improve constrained group formation, but the evidence should be interpreted as prototype-calibrated rather than as proof of industrial-scale business effectiveness.</p>
	]]></content:encoded>

	<dc:title>Preference Learning and Hybrid Combinatorial Optimization for Intelligent Group-Buying Platforms: A Prototype-Calibrated Study of SmartBuy Connect</dc:title>
			<dc:creator>Aizhan Kassymova</dc:creator>
			<dc:creator>Raissa Uskenbayeva</dc:creator>
			<dc:creator>Young Im Cho</dc:creator>
			<dc:creator>Venera Elle</dc:creator>
			<dc:creator>Aizhan Anartayeva</dc:creator>
			<dc:creator>Aizhan Smakhanova</dc:creator>
		<dc:identifier>doi: 10.3390/info17080768</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>768</prism:startingPage>
		<prism:doi>10.3390/info17080768</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/768</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/767">

	<title>Information, Vol. 17, Pages 767: Mapping ENDES-Based Research in Scopus: Scientific Output, Reporting, and Analytical Overlap, 2001&amp;ndash;2026</title>
	<link>https://www.mdpi.com/2078-2489/17/8/767</link>
	<description>National health surveys generate reusable population-based evidence, but repeated use may produce thematic concentration, heterogeneous methodological reporting, and analytical overlap. This revised bibliometric and meta-research study audited 328 Scopus records retrieved for Peru&amp;amp;rsquo;s Demographic and Family Health Survey (ENDES), excluded 14 records without eligible analytical ENDES use, and analyzed 314 publications. Matched full texts were available for 284 articles. Publications spanned 2001&amp;amp;ndash;2026 and increased mainly from 2019 onward. The most frequent thematic domains were Cardiometabolic health/adiposity (n = 93), Maternal/reproductive health (n = 77), and Child nutrition and growth (n = 39). The most reused ENDES years after validation were 2019 (n = 110), 2018 (n = 81), 2017 (n = 76), 2021 (n = 68), and 2022 (n = 66). Initial ENDES-year extraction showed a 25.4% false-positive rate, a 45.8% false-negative rate, and 28.3% complete article-level agreement. At a pairwise similarity threshold of 0.80, 32 analytical-overlap clusters were identified. The findings characterize the Scopus-indexed and Scopus-retrieved ENDES corpus and emphasize the need for explicit corpus auditing, transparent coding rules, validated survey-year extraction, and reproducible scripts.</description>
	<pubDate>2026-08-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 767: Mapping ENDES-Based Research in Scopus: Scientific Output, Reporting, and Analytical Overlap, 2001&amp;ndash;2026</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/767">doi: 10.3390/info17080767</a></p>
	<p>Authors:
		Victor J. Vera Ponce
		Fiorella E. Zuzunaga-Montoya
		Jhosmer Ballena-Caicedo
		Juan Carlos Bustamante-Rodriguez
		Holly Estrella Delgado-Toro
		Carmen Ines Gutierrez De Carrillo
		</p>
	<p>National health surveys generate reusable population-based evidence, but repeated use may produce thematic concentration, heterogeneous methodological reporting, and analytical overlap. This revised bibliometric and meta-research study audited 328 Scopus records retrieved for Peru&amp;amp;rsquo;s Demographic and Family Health Survey (ENDES), excluded 14 records without eligible analytical ENDES use, and analyzed 314 publications. Matched full texts were available for 284 articles. Publications spanned 2001&amp;amp;ndash;2026 and increased mainly from 2019 onward. The most frequent thematic domains were Cardiometabolic health/adiposity (n = 93), Maternal/reproductive health (n = 77), and Child nutrition and growth (n = 39). The most reused ENDES years after validation were 2019 (n = 110), 2018 (n = 81), 2017 (n = 76), 2021 (n = 68), and 2022 (n = 66). Initial ENDES-year extraction showed a 25.4% false-positive rate, a 45.8% false-negative rate, and 28.3% complete article-level agreement. At a pairwise similarity threshold of 0.80, 32 analytical-overlap clusters were identified. The findings characterize the Scopus-indexed and Scopus-retrieved ENDES corpus and emphasize the need for explicit corpus auditing, transparent coding rules, validated survey-year extraction, and reproducible scripts.</p>
	]]></content:encoded>

	<dc:title>Mapping ENDES-Based Research in Scopus: Scientific Output, Reporting, and Analytical Overlap, 2001&amp;amp;ndash;2026</dc:title>
			<dc:creator>Victor J. Vera Ponce</dc:creator>
			<dc:creator>Fiorella E. Zuzunaga-Montoya</dc:creator>
			<dc:creator>Jhosmer Ballena-Caicedo</dc:creator>
			<dc:creator>Juan Carlos Bustamante-Rodriguez</dc:creator>
			<dc:creator>Holly Estrella Delgado-Toro</dc:creator>
			<dc:creator>Carmen Ines Gutierrez De Carrillo</dc:creator>
		<dc:identifier>doi: 10.3390/info17080767</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>767</prism:startingPage>
		<prism:doi>10.3390/info17080767</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/767</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/766">

	<title>Information, Vol. 17, Pages 766: Language-Model-Based Architecture for Automatic Concept Placement in Ontologies</title>
	<link>https://www.mdpi.com/2078-2489/17/8/766</link>
	<description>Integrating newly emerging terms into existing ontologies is a recurring maintenance problem in knowledge engineering, particularly in biomedical domains where terminology evolves faster than manual curation can accommodate. This paper addresses the placement of concepts that are absent from the target ontology&amp;amp;mdash;the out-of-knowledge-base setting&amp;amp;mdash;in which a textual mention must be assigned one or more insertion positions in the subsumption hierarchy rather than linked to an existing node. We propose a three-stage framework that extends the conventional retrieve-then-select paradigm with an intermediate stage of edge generation and enrichment, which expands the candidate set by traversing the local structure of the ontology. Stage 1 retrieves candidate edges using a fine-tuned bi-encoder trained with a max-margin objective; Stage 2 constructs and structurally enriches candidate edges; Stage 3 selects among them using either a fine-tuned cross-encoder or a large language model under explainable instruction tuning. We evaluate on two datasets derived from SNOMED CT, MM-S14-Disease and MM-S14-CPP, under a strict out-of-knowledge-base protocol. Fine-tuned pre-trained language models outperform zero-shot and instruction-tuned large language models on ranking accuracy, while the instruction-tuned configuration produces expert-auditable justifications at a modest cost in accuracy. On MM-S14-Disease, the strongest configuration places a correct insertion edge among the ten highest-ranked candidates for 38.7% of test mentions and recovers the complete gold edge set for 16.4%, against 26.1% and 9.2% for retrieval alone. The framework is positioned as decision support for ontology curators rather than as an autonomous ontology generator.</description>
	<pubDate>2026-08-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 766: Language-Model-Based Architecture for Automatic Concept Placement in Ontologies</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/766">doi: 10.3390/info17080766</a></p>
	<p>Authors:
		Zhanna Sadirmekova
		Madina Sambetbayeva
		Bayangali Abdygalym
		Roman Taberkhan
		Anar Sultangaziyeva
		</p>
	<p>Integrating newly emerging terms into existing ontologies is a recurring maintenance problem in knowledge engineering, particularly in biomedical domains where terminology evolves faster than manual curation can accommodate. This paper addresses the placement of concepts that are absent from the target ontology&amp;amp;mdash;the out-of-knowledge-base setting&amp;amp;mdash;in which a textual mention must be assigned one or more insertion positions in the subsumption hierarchy rather than linked to an existing node. We propose a three-stage framework that extends the conventional retrieve-then-select paradigm with an intermediate stage of edge generation and enrichment, which expands the candidate set by traversing the local structure of the ontology. Stage 1 retrieves candidate edges using a fine-tuned bi-encoder trained with a max-margin objective; Stage 2 constructs and structurally enriches candidate edges; Stage 3 selects among them using either a fine-tuned cross-encoder or a large language model under explainable instruction tuning. We evaluate on two datasets derived from SNOMED CT, MM-S14-Disease and MM-S14-CPP, under a strict out-of-knowledge-base protocol. Fine-tuned pre-trained language models outperform zero-shot and instruction-tuned large language models on ranking accuracy, while the instruction-tuned configuration produces expert-auditable justifications at a modest cost in accuracy. On MM-S14-Disease, the strongest configuration places a correct insertion edge among the ten highest-ranked candidates for 38.7% of test mentions and recovers the complete gold edge set for 16.4%, against 26.1% and 9.2% for retrieval alone. The framework is positioned as decision support for ontology curators rather than as an autonomous ontology generator.</p>
	]]></content:encoded>

	<dc:title>Language-Model-Based Architecture for Automatic Concept Placement in Ontologies</dc:title>
			<dc:creator>Zhanna Sadirmekova</dc:creator>
			<dc:creator>Madina Sambetbayeva</dc:creator>
			<dc:creator>Bayangali Abdygalym</dc:creator>
			<dc:creator>Roman Taberkhan</dc:creator>
			<dc:creator>Anar Sultangaziyeva</dc:creator>
		<dc:identifier>doi: 10.3390/info17080766</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-10</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-10</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>766</prism:startingPage>
		<prism:doi>10.3390/info17080766</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/766</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/765">

	<title>Information, Vol. 17, Pages 765: SocioTable-KZ: Ethical and Privacy-Aware Bilingual Generation from Sociological Survey Data</title>
	<link>https://www.mdpi.com/2078-2489/17/8/765</link>
	<description>Large language model (LLM)-based assistants can make large sociological survey collections more accessible, but they may also increase the exposure of respondent-level information and socially sensitive content. This study presents SocioTable-KZ, a privacy-aware, risk-reducing pipeline for bilingual natural-language interpretation of relational sociological survey data from Kazakhstan. The source collection contains 2,385,890 records distributed across 28 linked tables. The pipeline combines identifier exclusion, deterministic JoinGraph serialisation, language-specific QLoRA adaptation of Qwen-family models, a three-class Safe&amp;amp;ndash;Sensitive&amp;amp;ndash;Unsafe safety module, constrained rewriting, and controlled release. Reference analytical texts were prepared through expert-curated seed examples followed by few-shot candidate generation and factual review. Generation experiments used independent Kazakh and Russian 80/10/10 splits with seed 42. The best reported Qwen3-4B configuration achieved BLEU/ROUGE-L/chrF scores of 29.07/49.88/58.31 for Kazakh and 46.67/65.00/68.40 for Russian. The safety-labelled corpus contained 1347 Kazakh and 3376 Russian instances. On the reported Kazakh evaluation corpus, the safety module achieved 0.925 accuracy and F1-scores of 0.87, 0.95, and 0.70 for Safe, Sensitive, and Unsafe, respectively; Unsafe recall was 0.59. The revised deployment protocol therefore prohibits unattended respondent-level release and requires deterministic identifier screening and human review for non-Safe or uncertain outputs. An official letter from the original data-collecting institution confirms active informed consent and authorised scientific use of the anonymised dataset. The evidence supports preliminary feasibility, not a formal privacy guarantee or production-readiness claim.</description>
	<pubDate>2026-08-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 765: SocioTable-KZ: Ethical and Privacy-Aware Bilingual Generation from Sociological Survey Data</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/765">doi: 10.3390/info17080765</a></p>
	<p>Authors:
		Assel Ospan
		Madina Mansurova
		Zhansaya Zhangabay
		Aktoty Zhappar
		</p>
	<p>Large language model (LLM)-based assistants can make large sociological survey collections more accessible, but they may also increase the exposure of respondent-level information and socially sensitive content. This study presents SocioTable-KZ, a privacy-aware, risk-reducing pipeline for bilingual natural-language interpretation of relational sociological survey data from Kazakhstan. The source collection contains 2,385,890 records distributed across 28 linked tables. The pipeline combines identifier exclusion, deterministic JoinGraph serialisation, language-specific QLoRA adaptation of Qwen-family models, a three-class Safe&amp;amp;ndash;Sensitive&amp;amp;ndash;Unsafe safety module, constrained rewriting, and controlled release. Reference analytical texts were prepared through expert-curated seed examples followed by few-shot candidate generation and factual review. Generation experiments used independent Kazakh and Russian 80/10/10 splits with seed 42. The best reported Qwen3-4B configuration achieved BLEU/ROUGE-L/chrF scores of 29.07/49.88/58.31 for Kazakh and 46.67/65.00/68.40 for Russian. The safety-labelled corpus contained 1347 Kazakh and 3376 Russian instances. On the reported Kazakh evaluation corpus, the safety module achieved 0.925 accuracy and F1-scores of 0.87, 0.95, and 0.70 for Safe, Sensitive, and Unsafe, respectively; Unsafe recall was 0.59. The revised deployment protocol therefore prohibits unattended respondent-level release and requires deterministic identifier screening and human review for non-Safe or uncertain outputs. An official letter from the original data-collecting institution confirms active informed consent and authorised scientific use of the anonymised dataset. The evidence supports preliminary feasibility, not a formal privacy guarantee or production-readiness claim.</p>
	]]></content:encoded>

	<dc:title>SocioTable-KZ: Ethical and Privacy-Aware Bilingual Generation from Sociological Survey Data</dc:title>
			<dc:creator>Assel Ospan</dc:creator>
			<dc:creator>Madina Mansurova</dc:creator>
			<dc:creator>Zhansaya Zhangabay</dc:creator>
			<dc:creator>Aktoty Zhappar</dc:creator>
		<dc:identifier>doi: 10.3390/info17080765</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-10</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-10</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>765</prism:startingPage>
		<prism:doi>10.3390/info17080765</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/765</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/764">

	<title>Information, Vol. 17, Pages 764: Anti-Jamming Drone Communication Using Wavelet and Adaptive Filter with Bidirectional Long Short-Term Memory</title>
	<link>https://www.mdpi.com/2078-2489/17/8/764</link>
	<description>Electronic attack (EA) using jamming signals is an essential component of electronic warfare (EW), consisting of the use of electromagnetic energy to disrupt, block or reduce the effectiveness of enemy communications, radar and navigation systems. In current conflicts, jamming EA is also successfully used against drones (air/ground), which have become an important component of modern warfare. In this context, the article proposes a method of protection against jamming (anti-jamming) for drone communications, thus achieving their resilience to electronic attack. The proposed method combines the wavelet transform with threshold SURE, adaptive filtering (LMS) and Bidirectional Long Short-Term Memory for anti-jamming resilience of 64-QAM (quadrature amplitude modulation) communication used by drones, evaluates the performance of the results obtained against electronic warfare systems and presents the open challenges for future research.</description>
	<pubDate>2026-08-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 764: Anti-Jamming Drone Communication Using Wavelet and Adaptive Filter with Bidirectional Long Short-Term Memory</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/764">doi: 10.3390/info17080764</a></p>
	<p>Authors:
		Ionut Dancau
		Catalin Dumitrescu
		Stefan Vasian
		Eduard Popovici
		Mara Chiosea
		</p>
	<p>Electronic attack (EA) using jamming signals is an essential component of electronic warfare (EW), consisting of the use of electromagnetic energy to disrupt, block or reduce the effectiveness of enemy communications, radar and navigation systems. In current conflicts, jamming EA is also successfully used against drones (air/ground), which have become an important component of modern warfare. In this context, the article proposes a method of protection against jamming (anti-jamming) for drone communications, thus achieving their resilience to electronic attack. The proposed method combines the wavelet transform with threshold SURE, adaptive filtering (LMS) and Bidirectional Long Short-Term Memory for anti-jamming resilience of 64-QAM (quadrature amplitude modulation) communication used by drones, evaluates the performance of the results obtained against electronic warfare systems and presents the open challenges for future research.</p>
	]]></content:encoded>

	<dc:title>Anti-Jamming Drone Communication Using Wavelet and Adaptive Filter with Bidirectional Long Short-Term Memory</dc:title>
			<dc:creator>Ionut Dancau</dc:creator>
			<dc:creator>Catalin Dumitrescu</dc:creator>
			<dc:creator>Stefan Vasian</dc:creator>
			<dc:creator>Eduard Popovici</dc:creator>
			<dc:creator>Mara Chiosea</dc:creator>
		<dc:identifier>doi: 10.3390/info17080764</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>764</prism:startingPage>
		<prism:doi>10.3390/info17080764</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/764</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/763">

	<title>Information, Vol. 17, Pages 763: Detecting Practical Attacks for Continuous-Variable Quantum Key Distribution Using Quantum k-Nearest Neighbor</title>
	<link>https://www.mdpi.com/2078-2489/17/8/763</link>
	<description>Continuous-variablequantum key distribution (CVQKD) enables information-theoretically secure communications between two legitimate users. However, practical CVQKD systems remain vulnerable to various attacks, while existing machine-learning-based detection schemes suffer from increasing computational complexity when processing large-scale monitoring data. In this paper, we propose a quantum k-nearest neighbor (QkNN)-based multiclass attack detection framework for CVQKD systems. Specifically, physical features extracted from Bob&amp;amp;rsquo;s monitoring data are encoded into quantum states and subsequently classified using the QkNN algorithm to identify different attack behaviors. Furthermore, by incorporating the attack ratio, retained-data ratio, and attack detection performance into secret key rate analysis, an attack-aware secret key rate model is established to characterize the influence of practical attacks on key generation. Simulation results demonstrate that the proposed scheme achieves high attack classification accuracy while significantly reducing computational complexity. Moreover, the proposed framework establishes a direct connection between attack detection and secret key generation, enabling a more realistic security evaluation for practical CVQKD systems.</description>
	<pubDate>2026-08-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 763: Detecting Practical Attacks for Continuous-Variable Quantum Key Distribution Using Quantum k-Nearest Neighbor</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/763">doi: 10.3390/info17080763</a></p>
	<p>Authors:
		Chan Liu
		Junhao Li
		Qin Liao
		</p>
	<p>Continuous-variablequantum key distribution (CVQKD) enables information-theoretically secure communications between two legitimate users. However, practical CVQKD systems remain vulnerable to various attacks, while existing machine-learning-based detection schemes suffer from increasing computational complexity when processing large-scale monitoring data. In this paper, we propose a quantum k-nearest neighbor (QkNN)-based multiclass attack detection framework for CVQKD systems. Specifically, physical features extracted from Bob&amp;amp;rsquo;s monitoring data are encoded into quantum states and subsequently classified using the QkNN algorithm to identify different attack behaviors. Furthermore, by incorporating the attack ratio, retained-data ratio, and attack detection performance into secret key rate analysis, an attack-aware secret key rate model is established to characterize the influence of practical attacks on key generation. Simulation results demonstrate that the proposed scheme achieves high attack classification accuracy while significantly reducing computational complexity. Moreover, the proposed framework establishes a direct connection between attack detection and secret key generation, enabling a more realistic security evaluation for practical CVQKD systems.</p>
	]]></content:encoded>

	<dc:title>Detecting Practical Attacks for Continuous-Variable Quantum Key Distribution Using Quantum k-Nearest Neighbor</dc:title>
			<dc:creator>Chan Liu</dc:creator>
			<dc:creator>Junhao Li</dc:creator>
			<dc:creator>Qin Liao</dc:creator>
		<dc:identifier>doi: 10.3390/info17080763</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>763</prism:startingPage>
		<prism:doi>10.3390/info17080763</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/763</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/762">

	<title>Information, Vol. 17, Pages 762: Attribution-Guided Prompt Optimization for Cross-CWE Vulnerability Detection</title>
	<link>https://www.mdpi.com/2078-2489/17/8/762</link>
	<description>Software vulnerability detection plays a critical role in improving software quality, system reliability, and security assurance. Prompt-based adaptation offers a lightweight alternative for vulnerability detection in low-resource Common Weakness Enumeration (CWE) settings, where labeled target-domain data are limited and model fine-tuning can be costly or unstable. This paper proposes an Integrated-Gradient-Guided Prompt Optimization (IGPO) method that uses attribution feedback to guide large language models in revising prompts for low-resource cross-CWE vulnerability detection. IGPO keeps the vulnerability detector fixed, evaluates the current prompt on target validation data, identifies false-positive and false-negative cases, computes Integrated Gradients (IG) for misclassified functions, aggregates token-level attributions into line-level feedback, and uses a large language model to diagnose error patterns and optimize the prompt. Experiments on C/C++ functions from PrimeVul, DiverseVul, and BigVul across 14 CWE categories show that, on positive-transfer source&amp;amp;ndash;target pairs, IGPO improves the average F1 score from 0.6780 to 0.7267 and outperforms the zero-shot baseline on 94.97% of them. These results position IGPO as an attribution-informed prompt adaptation framework that improves cross-CWE vulnerability detection without updating the detector, while highlighting the importance of backbone suitability under negative transfer. This method is particularly useful for security researchers and practitioners who need to adapt vulnerability detectors to new CWE categories with limited labeled data.</description>
	<pubDate>2026-08-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 762: Attribution-Guided Prompt Optimization for Cross-CWE Vulnerability Detection</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/762">doi: 10.3390/info17080762</a></p>
	<p>Authors:
		Xudong Xie
		Zhimao Lu
		Nianmin Yao
		</p>
	<p>Software vulnerability detection plays a critical role in improving software quality, system reliability, and security assurance. Prompt-based adaptation offers a lightweight alternative for vulnerability detection in low-resource Common Weakness Enumeration (CWE) settings, where labeled target-domain data are limited and model fine-tuning can be costly or unstable. This paper proposes an Integrated-Gradient-Guided Prompt Optimization (IGPO) method that uses attribution feedback to guide large language models in revising prompts for low-resource cross-CWE vulnerability detection. IGPO keeps the vulnerability detector fixed, evaluates the current prompt on target validation data, identifies false-positive and false-negative cases, computes Integrated Gradients (IG) for misclassified functions, aggregates token-level attributions into line-level feedback, and uses a large language model to diagnose error patterns and optimize the prompt. Experiments on C/C++ functions from PrimeVul, DiverseVul, and BigVul across 14 CWE categories show that, on positive-transfer source&amp;amp;ndash;target pairs, IGPO improves the average F1 score from 0.6780 to 0.7267 and outperforms the zero-shot baseline on 94.97% of them. These results position IGPO as an attribution-informed prompt adaptation framework that improves cross-CWE vulnerability detection without updating the detector, while highlighting the importance of backbone suitability under negative transfer. This method is particularly useful for security researchers and practitioners who need to adapt vulnerability detectors to new CWE categories with limited labeled data.</p>
	]]></content:encoded>

	<dc:title>Attribution-Guided Prompt Optimization for Cross-CWE Vulnerability Detection</dc:title>
			<dc:creator>Xudong Xie</dc:creator>
			<dc:creator>Zhimao Lu</dc:creator>
			<dc:creator>Nianmin Yao</dc:creator>
		<dc:identifier>doi: 10.3390/info17080762</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>762</prism:startingPage>
		<prism:doi>10.3390/info17080762</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/762</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/761">

	<title>Information, Vol. 17, Pages 761: QMPN: A Quality-Aware Memory Prompting Network for Few-Shot Multimodal Aspect-Based Sentiment Analysis</title>
	<link>https://www.mdpi.com/2078-2489/17/8/761</link>
	<description>Multimodal aspect-based sentiment analysis (MABSA) predicts the sentiment polarity associated with a specified aspect by jointly exploiting textual and visual information. Existing models may be sensitive to limited prompting examples, cross-modal noise, and unreliable generated context. This paper proposes QMPN, Quality-Aware Memory Prompting Network, that stores sample-specific prompts derived from a small support set, retrieves relevant prompting evidence for each query, and uses the retrieved prompts to guide aspect-aware context generation. A task-oriented quality gate, learned indirectly through the sentiment classification objective, controls the contribution of the generated context to the final prediction. Under the fixed protocol used in this study, QMPN employs 50 labeled support instances for prompt-memory construction and achieves 78.6% accuracy and 74.8% macro-F1 on Twitter-2015, and 72.0% accuracy and 70.5% macro-F1 on Twitter-2017. Relative to the variant without context generation, the complete model improves accuracy/macro-F1 by 3.31/2.83 percentage points on Twitter-2015 and 3.84/3.22 percentage points on Twitter-2017. Ablation and parameter analyses further show the contributions of memory retrieval, adaptive prompt selection, context generation, and quality-aware fusion. Because the evaluation is limited to two historical Twitter benchmarks and a single fixed seed, the reported results should be interpreted within this experimental scope rather than as evidence of universal cross-domain generalization.</description>
	<pubDate>2026-08-09</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 761: QMPN: A Quality-Aware Memory Prompting Network for Few-Shot Multimodal Aspect-Based Sentiment Analysis</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/761">doi: 10.3390/info17080761</a></p>
	<p>Authors:
		Lei Pan
		Tong Geng
		Yuheng Liu
		</p>
	<p>Multimodal aspect-based sentiment analysis (MABSA) predicts the sentiment polarity associated with a specified aspect by jointly exploiting textual and visual information. Existing models may be sensitive to limited prompting examples, cross-modal noise, and unreliable generated context. This paper proposes QMPN, Quality-Aware Memory Prompting Network, that stores sample-specific prompts derived from a small support set, retrieves relevant prompting evidence for each query, and uses the retrieved prompts to guide aspect-aware context generation. A task-oriented quality gate, learned indirectly through the sentiment classification objective, controls the contribution of the generated context to the final prediction. Under the fixed protocol used in this study, QMPN employs 50 labeled support instances for prompt-memory construction and achieves 78.6% accuracy and 74.8% macro-F1 on Twitter-2015, and 72.0% accuracy and 70.5% macro-F1 on Twitter-2017. Relative to the variant without context generation, the complete model improves accuracy/macro-F1 by 3.31/2.83 percentage points on Twitter-2015 and 3.84/3.22 percentage points on Twitter-2017. Ablation and parameter analyses further show the contributions of memory retrieval, adaptive prompt selection, context generation, and quality-aware fusion. Because the evaluation is limited to two historical Twitter benchmarks and a single fixed seed, the reported results should be interpreted within this experimental scope rather than as evidence of universal cross-domain generalization.</p>
	]]></content:encoded>

	<dc:title>QMPN: A Quality-Aware Memory Prompting Network for Few-Shot Multimodal Aspect-Based Sentiment Analysis</dc:title>
			<dc:creator>Lei Pan</dc:creator>
			<dc:creator>Tong Geng</dc:creator>
			<dc:creator>Yuheng Liu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080761</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-09</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-09</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>761</prism:startingPage>
		<prism:doi>10.3390/info17080761</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/761</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/760">

	<title>Information, Vol. 17, Pages 760: Composite Microservice Architecture of the Digital Twin</title>
	<link>https://www.mdpi.com/2078-2489/17/8/760</link>
	<description>Industrial digital twins integrate physical objects, dynamic models, control systems, data analysis tools, 2D and 3D visualization, and existing software systems. Much research has focused on the functional composition of the digital twin, modeling, and application scenarios, while the organization of the digital twin as an evolving software system composed of technologically heterogeneous and autonomous subsystems remains insufficiently formalized. The goal of this study is to develop a conceptual composite architecture for an industrial digital twin, in which complex subsystems are viewed as highly interconnected and loosely coupled service components of a higher-order system. The research method is based on analogy, transfer, and adaptation of proven principles of distributed and microservice systems to the constraints of industrial digital twins. An architectural model is proposed that includes a physical object, a process model, SCADA subsystems, a unified data exchange subsystem, 2D and 3D representations, VR/AR components, and automated model building modules. The practical feasibility of the approach is demonstrated using a proof-of-concept digital twin of a methanol&amp;amp;ndash;ammonia co-production plant, integrating Honeywell UniSim Design R460.1, web-based SCADA, Unity, and specialized 2D and 3D representation generation modules. This demonstration confirms the feasibility of integrating independently developed subsystems and the technological heterogeneity of the solution, but does not constitute a production test of performance, scalability, or cost effectiveness. Requirements for contract stability, a consistent interaction environment, assigned data responsibility, version compatibility, and complete documentation are defined. Research limitations and areas for subsequent quantitative architecture validation are identified.</description>
	<pubDate>2026-08-08</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 760: Composite Microservice Architecture of the Digital Twin</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/760">doi: 10.3390/info17080760</a></p>
	<p>Authors:
		Eleonora Koltsova
		Maksim Pysin
		Alexey Lobanov
		Anatoly Antipov
		Alexey Arkhipov
		Anton Perekatov
		Roman Krasheninnikov
		</p>
	<p>Industrial digital twins integrate physical objects, dynamic models, control systems, data analysis tools, 2D and 3D visualization, and existing software systems. Much research has focused on the functional composition of the digital twin, modeling, and application scenarios, while the organization of the digital twin as an evolving software system composed of technologically heterogeneous and autonomous subsystems remains insufficiently formalized. The goal of this study is to develop a conceptual composite architecture for an industrial digital twin, in which complex subsystems are viewed as highly interconnected and loosely coupled service components of a higher-order system. The research method is based on analogy, transfer, and adaptation of proven principles of distributed and microservice systems to the constraints of industrial digital twins. An architectural model is proposed that includes a physical object, a process model, SCADA subsystems, a unified data exchange subsystem, 2D and 3D representations, VR/AR components, and automated model building modules. The practical feasibility of the approach is demonstrated using a proof-of-concept digital twin of a methanol&amp;amp;ndash;ammonia co-production plant, integrating Honeywell UniSim Design R460.1, web-based SCADA, Unity, and specialized 2D and 3D representation generation modules. This demonstration confirms the feasibility of integrating independently developed subsystems and the technological heterogeneity of the solution, but does not constitute a production test of performance, scalability, or cost effectiveness. Requirements for contract stability, a consistent interaction environment, assigned data responsibility, version compatibility, and complete documentation are defined. Research limitations and areas for subsequent quantitative architecture validation are identified.</p>
	]]></content:encoded>

	<dc:title>Composite Microservice Architecture of the Digital Twin</dc:title>
			<dc:creator>Eleonora Koltsova</dc:creator>
			<dc:creator>Maksim Pysin</dc:creator>
			<dc:creator>Alexey Lobanov</dc:creator>
			<dc:creator>Anatoly Antipov</dc:creator>
			<dc:creator>Alexey Arkhipov</dc:creator>
			<dc:creator>Anton Perekatov</dc:creator>
			<dc:creator>Roman Krasheninnikov</dc:creator>
		<dc:identifier>doi: 10.3390/info17080760</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-08</dc:date>

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

	<title>Information, Vol. 17, Pages 759: Building Detection Under Forest Canopy Using Physically Interpretable SAR Features and Hybrid Machine Learning Across Multiple Forest Biomes</title>
	<link>https://www.mdpi.com/2078-2489/17/8/759</link>
	<description>Forests cover nearly one-third of the Earth&amp;amp;rsquo;s land surface and are subject to increasing anthropogenic pressure, including unauthorised construction, infrastructure expansion, and habitat fragmentation. Detecting buildings concealed beneath forest canopy is essential for environmental monitoring and territorial surveillance, yet optical satellite imagery fails under persistent cloud cover and dense vegetation, and no existing approach provides reliable detection across contrasting forest ecosystems. We address this gap by proposing a hybrid SAR-based detection framework that combines twelve physically interpretable Scattering-Informed SAR Features (SISF)&amp;amp;mdash;derived from electromagnetic scattering theory across amplitude, polarimetric, temporal, and texture dimensions&amp;amp;mdash;with a universal Convolutional Neural Network, integrated through probability-level fusion with isotonic regional calibration. Rather than relying on individual feature thresholds, the framework identifies buildings through their characteristic multidimensional scattering signature&amp;amp;mdash;a combination that remains discriminative across biomes where any single SAR descriptor would fail. The framework was evaluated on a novel 7721-object multi-biome benchmark spanning forest-steppe (Kazakhstan), boreal forest (Komi Republic, Russia), and tropical rainforest (Brazil, Par&amp;amp;aacute;). The final Fusion + Regional Calibration model achieved an overall F1-score of 0.803 on the held-out test set (N = 1545), outperforming single-model baselines by up to 17 percentage points. Regional F1-scores ranged from 0.727 (Kazakhstan) to 0.944 (Komi Republic), with detection performance remaining robust under partial canopy occlusion (F1 = 0.911, versus 0.903 for unobscured buildings). An empirical inverse relationship between hard negative proportion and detection F1-score was identified within each biome, with the 28&amp;amp;ndash;35% proportions present in our sampled regions reported as a preliminary observation rather than a generally optimal range&amp;amp;mdash;a dataset design finding not previously reported in the literature. The proposed framework provides a physically interpretable solution for SAR-based building detection under forest canopy, demonstrating consistent performance across three contrasting forest biomes, with direct applications to environmental monitoring and territorial surveillance in forested regions.</description>
	<pubDate>2026-08-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 759: Building Detection Under Forest Canopy Using Physically Interpretable SAR Features and Hybrid Machine Learning Across Multiple Forest Biomes</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/759">doi: 10.3390/info17080759</a></p>
	<p>Authors:
		Dilyara Nazyrova
		Zhangeldi Aitkozha
		Valery Starovoitov
		</p>
	<p>Forests cover nearly one-third of the Earth&amp;amp;rsquo;s land surface and are subject to increasing anthropogenic pressure, including unauthorised construction, infrastructure expansion, and habitat fragmentation. Detecting buildings concealed beneath forest canopy is essential for environmental monitoring and territorial surveillance, yet optical satellite imagery fails under persistent cloud cover and dense vegetation, and no existing approach provides reliable detection across contrasting forest ecosystems. We address this gap by proposing a hybrid SAR-based detection framework that combines twelve physically interpretable Scattering-Informed SAR Features (SISF)&amp;amp;mdash;derived from electromagnetic scattering theory across amplitude, polarimetric, temporal, and texture dimensions&amp;amp;mdash;with a universal Convolutional Neural Network, integrated through probability-level fusion with isotonic regional calibration. Rather than relying on individual feature thresholds, the framework identifies buildings through their characteristic multidimensional scattering signature&amp;amp;mdash;a combination that remains discriminative across biomes where any single SAR descriptor would fail. The framework was evaluated on a novel 7721-object multi-biome benchmark spanning forest-steppe (Kazakhstan), boreal forest (Komi Republic, Russia), and tropical rainforest (Brazil, Par&amp;amp;aacute;). The final Fusion + Regional Calibration model achieved an overall F1-score of 0.803 on the held-out test set (N = 1545), outperforming single-model baselines by up to 17 percentage points. Regional F1-scores ranged from 0.727 (Kazakhstan) to 0.944 (Komi Republic), with detection performance remaining robust under partial canopy occlusion (F1 = 0.911, versus 0.903 for unobscured buildings). An empirical inverse relationship between hard negative proportion and detection F1-score was identified within each biome, with the 28&amp;amp;ndash;35% proportions present in our sampled regions reported as a preliminary observation rather than a generally optimal range&amp;amp;mdash;a dataset design finding not previously reported in the literature. The proposed framework provides a physically interpretable solution for SAR-based building detection under forest canopy, demonstrating consistent performance across three contrasting forest biomes, with direct applications to environmental monitoring and territorial surveillance in forested regions.</p>
	]]></content:encoded>

	<dc:title>Building Detection Under Forest Canopy Using Physically Interpretable SAR Features and Hybrid Machine Learning Across Multiple Forest Biomes</dc:title>
			<dc:creator>Dilyara Nazyrova</dc:creator>
			<dc:creator>Zhangeldi Aitkozha</dc:creator>
			<dc:creator>Valery Starovoitov</dc:creator>
		<dc:identifier>doi: 10.3390/info17080759</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-07</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-07</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>759</prism:startingPage>
		<prism:doi>10.3390/info17080759</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/759</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/758">

	<title>Information, Vol. 17, Pages 758: Machine Learning Framework for Cross-Ranking Analysis and Estimation of University Positions in Global Rankings</title>
	<link>https://www.mdpi.com/2078-2489/17/8/758</link>
	<description>This study presents a methodology for cross-ranking analysis to evaluate the consistency of universities&amp;amp;rsquo; positions across the QS World University Rankings, Times Higher Education (THE) World University Rankings, and Academic Ranking of World Universities (ARWU). Data for 2022&amp;amp;ndash;2025 were harmonized by university names, countries, years, and ranking positions, resulting in a unified dataset of 316 observations. Ranking agreement was assessed using the overlap of ranked lists, a Spearman distance&amp;amp;ndash;based similarity measure, and a normalized inverse-rank metric. QS rankings were treated as the response variable, while THE and ARWU positions served as predictors. Model performance was evaluated using leave-one-year-out cross-validation for a median baseline, the average of THE and ARWU ranks, linear regression, Random Forest, and XGBoost. Random Forest achieved the lowest mean absolute error (MAE = 24.80 &amp;amp;plusmn; 3.26 ranking positions), whereas linear regression best preserved relative ordering (Spearman&amp;amp;rsquo;s &amp;amp;rho; = 0.794 &amp;amp;plusmn; 0.062). Additional analyses of the TOP-50, TOP-100, and TOP-200 subsets showed that prediction accuracy decreases as ranking depth increases. The findings demonstrate that QS, THE, and ARWU provide complementary rather than interchangeable assessments of university performance. The proposed framework is intended for comparative cross-ranking analysis rather than forecasting future university rankings.</description>
	<pubDate>2026-08-07</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 758: Machine Learning Framework for Cross-Ranking Analysis and Estimation of University Positions in Global Rankings</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/758">doi: 10.3390/info17080758</a></p>
	<p>Authors:
		Nursultan Kuldeyev
		Emil Andekin
		Vassiliy Serbin
		Darkhan Yerezhep
		Orazmukhamed Bekmurat
		Kanibek Sansyzbay
		Yelena Bakhtiyarova
		Laura Tasbolatova
		</p>
	<p>This study presents a methodology for cross-ranking analysis to evaluate the consistency of universities&amp;amp;rsquo; positions across the QS World University Rankings, Times Higher Education (THE) World University Rankings, and Academic Ranking of World Universities (ARWU). Data for 2022&amp;amp;ndash;2025 were harmonized by university names, countries, years, and ranking positions, resulting in a unified dataset of 316 observations. Ranking agreement was assessed using the overlap of ranked lists, a Spearman distance&amp;amp;ndash;based similarity measure, and a normalized inverse-rank metric. QS rankings were treated as the response variable, while THE and ARWU positions served as predictors. Model performance was evaluated using leave-one-year-out cross-validation for a median baseline, the average of THE and ARWU ranks, linear regression, Random Forest, and XGBoost. Random Forest achieved the lowest mean absolute error (MAE = 24.80 &amp;amp;plusmn; 3.26 ranking positions), whereas linear regression best preserved relative ordering (Spearman&amp;amp;rsquo;s &amp;amp;rho; = 0.794 &amp;amp;plusmn; 0.062). Additional analyses of the TOP-50, TOP-100, and TOP-200 subsets showed that prediction accuracy decreases as ranking depth increases. The findings demonstrate that QS, THE, and ARWU provide complementary rather than interchangeable assessments of university performance. The proposed framework is intended for comparative cross-ranking analysis rather than forecasting future university rankings.</p>
	]]></content:encoded>

	<dc:title>Machine Learning Framework for Cross-Ranking Analysis and Estimation of University Positions in Global Rankings</dc:title>
			<dc:creator>Nursultan Kuldeyev</dc:creator>
			<dc:creator>Emil Andekin</dc:creator>
			<dc:creator>Vassiliy Serbin</dc:creator>
			<dc:creator>Darkhan Yerezhep</dc:creator>
			<dc:creator>Orazmukhamed Bekmurat</dc:creator>
			<dc:creator>Kanibek Sansyzbay</dc:creator>
			<dc:creator>Yelena Bakhtiyarova</dc:creator>
			<dc:creator>Laura Tasbolatova</dc:creator>
		<dc:identifier>doi: 10.3390/info17080758</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-07</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-07</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>758</prism:startingPage>
		<prism:doi>10.3390/info17080758</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/758</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/757">

	<title>Information, Vol. 17, Pages 757: Public Trust in Generative AI: Risk Perceptions, Regulatory Safeguards, and the Acceptance of Deepfake Technology</title>
	<link>https://www.mdpi.com/2078-2489/17/8/757</link>
	<description>Generative artificial intelligence (GenAI) now produces synthetic text, images, audio, and video at a quality and cost that place convincing synthetic fabrication within reach of non-specialist users. Deepfakes, synthetic media that alter a person&amp;amp;rsquo;s appearance, voice, or behavior through machine learning (ML), are one of the most contested applications of this capability, yet public willingness to accept them under regulation remains less understood. This study examines how perceived benefits, perceived risks, privacy concerns, and demographic characteristics relate to trust in deepfake technology under regulatory safeguards. Survey data from 924 respondents from several countries were analyzed using descriptive statistics, independent-samples t-tests, analysis of variance, multiple regression, and thematic analysis of open-ended responses. Respondents recognized the potential benefits of deepfake technology for digital content creation and education while expressing widespread concern about misinformation, privacy violations, and criminal misuse. When respondents evaluated deepfake technology under an assumed privacy-protecting regulatory scenario, perceived risks did not independently predict trust, while perceived benefits were the strongest predictors. The findings indicate that institutional confidence may contribute to public acceptance of beneficial applications of generative AI, although the cross-sectional design does not establish a causal effect of regulation.</description>
	<pubDate>2026-08-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 757: Public Trust in Generative AI: Risk Perceptions, Regulatory Safeguards, and the Acceptance of Deepfake Technology</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/757">doi: 10.3390/info17080757</a></p>
	<p>Authors:
		Cathrine Linnes
		Giulio Ronzoni
		Joseph Lema
		Babu George
		Jerome Agrusa
		</p>
	<p>Generative artificial intelligence (GenAI) now produces synthetic text, images, audio, and video at a quality and cost that place convincing synthetic fabrication within reach of non-specialist users. Deepfakes, synthetic media that alter a person&amp;amp;rsquo;s appearance, voice, or behavior through machine learning (ML), are one of the most contested applications of this capability, yet public willingness to accept them under regulation remains less understood. This study examines how perceived benefits, perceived risks, privacy concerns, and demographic characteristics relate to trust in deepfake technology under regulatory safeguards. Survey data from 924 respondents from several countries were analyzed using descriptive statistics, independent-samples t-tests, analysis of variance, multiple regression, and thematic analysis of open-ended responses. Respondents recognized the potential benefits of deepfake technology for digital content creation and education while expressing widespread concern about misinformation, privacy violations, and criminal misuse. When respondents evaluated deepfake technology under an assumed privacy-protecting regulatory scenario, perceived risks did not independently predict trust, while perceived benefits were the strongest predictors. The findings indicate that institutional confidence may contribute to public acceptance of beneficial applications of generative AI, although the cross-sectional design does not establish a causal effect of regulation.</p>
	]]></content:encoded>

	<dc:title>Public Trust in Generative AI: Risk Perceptions, Regulatory Safeguards, and the Acceptance of Deepfake Technology</dc:title>
			<dc:creator>Cathrine Linnes</dc:creator>
			<dc:creator>Giulio Ronzoni</dc:creator>
			<dc:creator>Joseph Lema</dc:creator>
			<dc:creator>Babu George</dc:creator>
			<dc:creator>Jerome Agrusa</dc:creator>
		<dc:identifier>doi: 10.3390/info17080757</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-06</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-06</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>757</prism:startingPage>
		<prism:doi>10.3390/info17080757</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/757</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/756">

	<title>Information, Vol. 17, Pages 756: Developing a Kazakh Audio&amp;ndash;Visual Multimodal Speech Recognition Model Based on Hierarchical and Cross-Modal Attention</title>
	<link>https://www.mdpi.com/2078-2489/17/8/756</link>
	<description>This study presents an audio&amp;amp;ndash;visual speech recognition (AVSR) model for Kazakh that jointly exploits audio and visual channels. The study introduces QazAVSR, a 57 h dataset collected from 271 speakers, and extracts synchronized audio signals and lip-region video sequences using FFmpeg 7.0, Dlib 19.24, and OpenCV 4.9.0. The proposed architecture uses the self-supervised HuBERT_BASE model in the audio branch and an ImageNet-pretrained ViT-B/16 model in the visual branch. Audio and visual representations are fused by a three-layer BiModalHformer block, where intra- and cross-attention operations are performed at each level. Extensive experimental validation, supplemented by rigorous paired bootstrap resampling significance tests, demonstrates that the full multimodal BiModalHformer model achieves a highly robust average character error rate (CER) of 31.2% and a Word Error Rate (WER) of 43.1%. These results significantly outperform traditional audio-only, video-only, and standard representation-level fusion baselines. Furthermore, comparisons against powerful external baseline architectures&amp;amp;mdash;including Whisper-Small and AV-HuBERT configurations rigorously adapted for the Kazakh language&amp;amp;mdash;statistically validate the architectural efficacy of the BiModalHformer framework. Additional systematic evaluations utilizing extended metrics such as the Match Error Rate (MER), word information preserved (WIP), and the Multimodal Synergy Index (MSI) confirm that the full audio&amp;amp;ndash;visual configuration preserves lexical information significantly more effectively. Finally, extensive noise perturbation experiments confirm that the multimodal architecture exhibits superior structural robustness to complex acoustic distortions, including environmental noise, synthetic room reverberation, and overlapping speech topologies.</description>
	<pubDate>2026-08-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 756: Developing a Kazakh Audio&amp;ndash;Visual Multimodal Speech Recognition Model Based on Hierarchical and Cross-Modal Attention</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/756">doi: 10.3390/info17080756</a></p>
	<p>Authors:
		Turdybek Kurmetkan
		Orken Mamyrbayev
		Adem Tekerek
		Ainur Toleu
		</p>
	<p>This study presents an audio&amp;amp;ndash;visual speech recognition (AVSR) model for Kazakh that jointly exploits audio and visual channels. The study introduces QazAVSR, a 57 h dataset collected from 271 speakers, and extracts synchronized audio signals and lip-region video sequences using FFmpeg 7.0, Dlib 19.24, and OpenCV 4.9.0. The proposed architecture uses the self-supervised HuBERT_BASE model in the audio branch and an ImageNet-pretrained ViT-B/16 model in the visual branch. Audio and visual representations are fused by a three-layer BiModalHformer block, where intra- and cross-attention operations are performed at each level. Extensive experimental validation, supplemented by rigorous paired bootstrap resampling significance tests, demonstrates that the full multimodal BiModalHformer model achieves a highly robust average character error rate (CER) of 31.2% and a Word Error Rate (WER) of 43.1%. These results significantly outperform traditional audio-only, video-only, and standard representation-level fusion baselines. Furthermore, comparisons against powerful external baseline architectures&amp;amp;mdash;including Whisper-Small and AV-HuBERT configurations rigorously adapted for the Kazakh language&amp;amp;mdash;statistically validate the architectural efficacy of the BiModalHformer framework. Additional systematic evaluations utilizing extended metrics such as the Match Error Rate (MER), word information preserved (WIP), and the Multimodal Synergy Index (MSI) confirm that the full audio&amp;amp;ndash;visual configuration preserves lexical information significantly more effectively. Finally, extensive noise perturbation experiments confirm that the multimodal architecture exhibits superior structural robustness to complex acoustic distortions, including environmental noise, synthetic room reverberation, and overlapping speech topologies.</p>
	]]></content:encoded>

	<dc:title>Developing a Kazakh Audio&amp;amp;ndash;Visual Multimodal Speech Recognition Model Based on Hierarchical and Cross-Modal Attention</dc:title>
			<dc:creator>Turdybek Kurmetkan</dc:creator>
			<dc:creator>Orken Mamyrbayev</dc:creator>
			<dc:creator>Adem Tekerek</dc:creator>
			<dc:creator>Ainur Toleu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080756</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-06</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-06</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>756</prism:startingPage>
		<prism:doi>10.3390/info17080756</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/756</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/755">

	<title>Information, Vol. 17, Pages 755: Beyond Adoption: The Shaping of Cloud Accounting Information Systems Usage Through Organizational Factors and IT Governance</title>
	<link>https://www.mdpi.com/2078-2489/17/8/755</link>
	<description>Information Systems (IS) play a critical role in managing and optimizing core business processes and financial operations within small and medium-sized enterprises (SMEs). Specifically, Cloud-based Accounting Information Systems (CAIS) represent a significant digital innovation that is reshaping accounting practices and financial management in SMEs. Despite growing adoption, limited empirical evidence exists on the organizational and governance factors influencing CAIS implementation in developing economies. This paper conducts empirical research primarily examining how organizational culture, organizational structure, and organizational support shape the effective adoption and usage of CAIS among SMEs in Jordan. In particular, the study explores the moderating role of Information Technology Governance (ITG) in the relationships between these organizational factors and CAIS usage. Drawing on the Information Systems and digital accounting literature, this study employs quantitative research design using PLS-SEM. An adapted model is derived from the Technology&amp;amp;ndash;Organization&amp;amp;ndash;Environment perspectives in adoption technological and contextual factors. Data was collected through a structured questionnaire from 397 Jordanian SME professionals across various managerial and accounting roles. The findings reveal that organizational culture exerts the strongest positive influence on CAIS adoption (&amp;amp;beta; = 0.537, p &amp;amp;lt; 0.001), followed by organizational structure (&amp;amp;beta; = 0.296, p &amp;amp;lt; 0.001) and organizational support (&amp;amp;beta; = 0.226, p &amp;amp;lt; 0.001). ITG also demonstrates a significant direct effect on CAIS adoption (&amp;amp;beta; = 0.218, p &amp;amp;lt; 0.001). Mediation analysis indicates that ITG significantly strengthens the relationship between organizational support and CAIS adoption (&amp;amp;beta; = 0.089, p = 0.035), while its moderating effects on organizational culture and structure are not statistically significant. This research contributes to the digital accounting and Information Systems literature by providing nuanced insights into the conditional role of ITG in CAIS adoption, moving beyond traditional direct-effect models. From an empirical perspective, the findings recommend that policymakers and SME managers must priorities IT governance frameworks alongside organizational support mechanisms to facilitate effective CAIS implementation in emerging markets. Furthermore, prior studies have largely focused on technological determinants or direct effects of organizational factors, while providing limited insight into how IT governance shapes the relationship between organizational capabilities and CAIS adoption within SMEs in emerging economies.</description>
	<pubDate>2026-08-06</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 755: Beyond Adoption: The Shaping of Cloud Accounting Information Systems Usage Through Organizational Factors and IT Governance</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/755">doi: 10.3390/info17080755</a></p>
	<p>Authors:
		Nashat Ali Almasria
		Ayman Abu Haija
		Manaf Al-Okaily
		Ahmad Abu-Dawleh
		Riyad Neman Darwazeh
		Yasean A. Tahat
		</p>
	<p>Information Systems (IS) play a critical role in managing and optimizing core business processes and financial operations within small and medium-sized enterprises (SMEs). Specifically, Cloud-based Accounting Information Systems (CAIS) represent a significant digital innovation that is reshaping accounting practices and financial management in SMEs. Despite growing adoption, limited empirical evidence exists on the organizational and governance factors influencing CAIS implementation in developing economies. This paper conducts empirical research primarily examining how organizational culture, organizational structure, and organizational support shape the effective adoption and usage of CAIS among SMEs in Jordan. In particular, the study explores the moderating role of Information Technology Governance (ITG) in the relationships between these organizational factors and CAIS usage. Drawing on the Information Systems and digital accounting literature, this study employs quantitative research design using PLS-SEM. An adapted model is derived from the Technology&amp;amp;ndash;Organization&amp;amp;ndash;Environment perspectives in adoption technological and contextual factors. Data was collected through a structured questionnaire from 397 Jordanian SME professionals across various managerial and accounting roles. The findings reveal that organizational culture exerts the strongest positive influence on CAIS adoption (&amp;amp;beta; = 0.537, p &amp;amp;lt; 0.001), followed by organizational structure (&amp;amp;beta; = 0.296, p &amp;amp;lt; 0.001) and organizational support (&amp;amp;beta; = 0.226, p &amp;amp;lt; 0.001). ITG also demonstrates a significant direct effect on CAIS adoption (&amp;amp;beta; = 0.218, p &amp;amp;lt; 0.001). Mediation analysis indicates that ITG significantly strengthens the relationship between organizational support and CAIS adoption (&amp;amp;beta; = 0.089, p = 0.035), while its moderating effects on organizational culture and structure are not statistically significant. This research contributes to the digital accounting and Information Systems literature by providing nuanced insights into the conditional role of ITG in CAIS adoption, moving beyond traditional direct-effect models. From an empirical perspective, the findings recommend that policymakers and SME managers must priorities IT governance frameworks alongside organizational support mechanisms to facilitate effective CAIS implementation in emerging markets. Furthermore, prior studies have largely focused on technological determinants or direct effects of organizational factors, while providing limited insight into how IT governance shapes the relationship between organizational capabilities and CAIS adoption within SMEs in emerging economies.</p>
	]]></content:encoded>

	<dc:title>Beyond Adoption: The Shaping of Cloud Accounting Information Systems Usage Through Organizational Factors and IT Governance</dc:title>
			<dc:creator>Nashat Ali Almasria</dc:creator>
			<dc:creator>Ayman Abu Haija</dc:creator>
			<dc:creator>Manaf Al-Okaily</dc:creator>
			<dc:creator>Ahmad Abu-Dawleh</dc:creator>
			<dc:creator>Riyad Neman Darwazeh</dc:creator>
			<dc:creator>Yasean A. Tahat</dc:creator>
		<dc:identifier>doi: 10.3390/info17080755</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-06</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-06</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>755</prism:startingPage>
		<prism:doi>10.3390/info17080755</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/755</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/754">

	<title>Information, Vol. 17, Pages 754: Deriving Wave Height Using Image Shadow Feature and Extracted Principal Component</title>
	<link>https://www.mdpi.com/2078-2489/17/8/754</link>
	<description>Benefiting from the merit of independent calibration without external reference, the shadow feature is investigated to retrieve wave steepness and wave height from X-band marine radar images. However, the wave period is currently required. Although the wave period could be achieved using the fundamental spectrum analysis technology from a radar image sequence, an external measuring device, like a wave buoy, is essential for the calibration of the wave spectrum. To solve this problem, an improved method for deriving significant wave height (SWH) is proposed by fusing the wave steepness extracted from the shadow feature of the radar image and the wavelength derived through rotated empirical orthogonal function analysis technology. Considering the attenuation relation of received echo in the distance direction, echo intensity calibration is adopted before extracting principal components. The collected X-band marine radar images are applied to verify the performance of the established SWH retrieval approach, with the observation of the wave buoy serving as the ground truth. Compared with the fundamental shadow statistical method, the correlation coefficient of the proposed approach rises by 0.08, while the root mean square error drops by 0.05 m.</description>
	<pubDate>2026-08-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 754: Deriving Wave Height Using Image Shadow Feature and Extracted Principal Component</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/754">doi: 10.3390/info17080754</a></p>
	<p>Authors:
		Yang Meng
		Jinda Wang
		Tao Zhou
		Fei Niu
		Yanbo Wei
		</p>
	<p>Benefiting from the merit of independent calibration without external reference, the shadow feature is investigated to retrieve wave steepness and wave height from X-band marine radar images. However, the wave period is currently required. Although the wave period could be achieved using the fundamental spectrum analysis technology from a radar image sequence, an external measuring device, like a wave buoy, is essential for the calibration of the wave spectrum. To solve this problem, an improved method for deriving significant wave height (SWH) is proposed by fusing the wave steepness extracted from the shadow feature of the radar image and the wavelength derived through rotated empirical orthogonal function analysis technology. Considering the attenuation relation of received echo in the distance direction, echo intensity calibration is adopted before extracting principal components. The collected X-band marine radar images are applied to verify the performance of the established SWH retrieval approach, with the observation of the wave buoy serving as the ground truth. Compared with the fundamental shadow statistical method, the correlation coefficient of the proposed approach rises by 0.08, while the root mean square error drops by 0.05 m.</p>
	]]></content:encoded>

	<dc:title>Deriving Wave Height Using Image Shadow Feature and Extracted Principal Component</dc:title>
			<dc:creator>Yang Meng</dc:creator>
			<dc:creator>Jinda Wang</dc:creator>
			<dc:creator>Tao Zhou</dc:creator>
			<dc:creator>Fei Niu</dc:creator>
			<dc:creator>Yanbo Wei</dc:creator>
		<dc:identifier>doi: 10.3390/info17080754</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-05</dc:date>

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

	<title>Information, Vol. 17, Pages 753: Ensemble-Based Approach for Amazigh POS Tagging: Leveraging Multiple Models for Enhanced Performance in Low-Resource Language Processing</title>
	<link>https://www.mdpi.com/2078-2489/17/8/753</link>
	<description>Part-of-Speech (POS) tagging is a foundational task in Natural Language Processing (NLP), yet it remains challenging for low-resource and morphologically rich languages such as Amazigh. This paper proposes a hybrid ensemble framework for Amazigh POS tagging that integrates three complementary models: a Bidirectional Long Short-Term Memory network (BiLSTM), a Conditional Random Field model (CRF), and a rule-based morphological analyzer (RBMA). Rather than treating prior results obtained on different corpora and tag inventories as directly comparable, the study evaluates all proposed components under a common 54-tag experimental setting based on the publicly available Amazigh Linguistic Dataset. Three ensemble strategies are examined: majority voting, validation-weighted voting, and logistic-regression stacking. An additional late-fusion ablation applies hard and soft RBMA constraints to CRF and Stacking outputs; hard masking degrades performance substantially, whereas soft masking is more robust but remains below unconstrained decoding. The best micro-level performance is obtained by the stacking ensemble, which reaches 98.51% Micro-F1/accuracy, whereas the boosting-like weighted ensemble obtains the strongest Macro-F1 among the ensemble variants, reaching 74.24%. These results show that hybrid ensemble methods can improve token-level accuracy in low-resource POS tagging, while also revealing a trade-off between frequent-tag accuracy and rare-tag robustness. The findings highlight the usefulness of combining neural, probabilistic, and rule-based information for Amazigh POS tagging, and point to class-balanced meta-learning and character/subword representations as important directions for improving rare and out-of-vocabulary categories.</description>
	<pubDate>2026-08-05</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 753: Ensemble-Based Approach for Amazigh POS Tagging: Leveraging Multiple Models for Enhanced Performance in Low-Resource Language Processing</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/753">doi: 10.3390/info17080753</a></p>
	<p>Authors:
		Abdelouahed Moussaoui
		Nor-Eddine Azalmad
		Said Bahassine
		Khalid Housni
		</p>
	<p>Part-of-Speech (POS) tagging is a foundational task in Natural Language Processing (NLP), yet it remains challenging for low-resource and morphologically rich languages such as Amazigh. This paper proposes a hybrid ensemble framework for Amazigh POS tagging that integrates three complementary models: a Bidirectional Long Short-Term Memory network (BiLSTM), a Conditional Random Field model (CRF), and a rule-based morphological analyzer (RBMA). Rather than treating prior results obtained on different corpora and tag inventories as directly comparable, the study evaluates all proposed components under a common 54-tag experimental setting based on the publicly available Amazigh Linguistic Dataset. Three ensemble strategies are examined: majority voting, validation-weighted voting, and logistic-regression stacking. An additional late-fusion ablation applies hard and soft RBMA constraints to CRF and Stacking outputs; hard masking degrades performance substantially, whereas soft masking is more robust but remains below unconstrained decoding. The best micro-level performance is obtained by the stacking ensemble, which reaches 98.51% Micro-F1/accuracy, whereas the boosting-like weighted ensemble obtains the strongest Macro-F1 among the ensemble variants, reaching 74.24%. These results show that hybrid ensemble methods can improve token-level accuracy in low-resource POS tagging, while also revealing a trade-off between frequent-tag accuracy and rare-tag robustness. The findings highlight the usefulness of combining neural, probabilistic, and rule-based information for Amazigh POS tagging, and point to class-balanced meta-learning and character/subword representations as important directions for improving rare and out-of-vocabulary categories.</p>
	]]></content:encoded>

	<dc:title>Ensemble-Based Approach for Amazigh POS Tagging: Leveraging Multiple Models for Enhanced Performance in Low-Resource Language Processing</dc:title>
			<dc:creator>Abdelouahed Moussaoui</dc:creator>
			<dc:creator>Nor-Eddine Azalmad</dc:creator>
			<dc:creator>Said Bahassine</dc:creator>
			<dc:creator>Khalid Housni</dc:creator>
		<dc:identifier>doi: 10.3390/info17080753</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-05</dc:date>

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

	<title>Information, Vol. 17, Pages 752: A Scalarized Weighted-Sum Hybrid GA&amp;ndash;PSO Decision-Support Framework for Constrained Water Resource Scheduling</title>
	<link>https://www.mdpi.com/2078-2489/17/8/752</link>
	<description>Water resource management increasingly requires allocation methods that address rising demand, climate variability, and operational inefficiency. This study proposes an elite-transfer hybrid Genetic Algorithm&amp;amp;ndash;Particle Swarm Optimization framework for constrained water allocation under a weighted-sum scalarization model. The model combines four normalized objectives: minimizing water shortage, an operational cost coefficient, and allocation imbalance while maximizing utilization efficiency through an equivalent minimization term. A bidirectional elite-transfer mechanism links GA-based global exploration with PSO-based local refinement. The framework was evaluated using two capacity-constrained surrogate scenarios anchored to hydrometeorological records from T&amp;amp;uuml;rkiye: Melekbah&amp;amp;ccedil;e station (E21A033) in the Upper Euphrates Basin and Be&amp;amp;#351;de&amp;amp;#287;irmen station (E12A003) in the Sakarya Basin. Daily streamflow records supported scenario construction, while precipitation and air-temperature data characterized local conditions. The proposed method was compared with standalone GA and standalone PSO, Differential Evolution, Grey Wolf Optimizer, a scalarized NSGA-II, adapted Kao&amp;amp;ndash;Zahara and Garg GA&amp;amp;ndash;PSO hybrids, and a no-elite ablation. All methods used the same objective formulation, normalization bounds, constraint-repair procedure, equal objective weights, tuning protocol, paired random seeds, and a budget of 10,000 objective-function evaluations. Performance was assessed through 30 paired runs per scenario. The proposed framework achieved the lowest mean scalar fitness values&amp;amp;mdash;0.1670 for Melekbah&amp;amp;ccedil;e and 0.1752 for Be&amp;amp;#351;de&amp;amp;#287;irmen&amp;amp;mdash;and reached the predefined convergence region after averages of 4587 and 4780 evaluations, respectively. All fitness and convergence improvements remained significant after Holm correction. Paired rank-biserial correlations ranged from 0.957 to 1.000 against the seven general comparators and were 0.824 and 0.781 against the no-elite ablation. The findings support the framework under the tested surrogate scenarios but do not establish Pareto-front dominance or universal superiority. Future work should examine measured operational data, additional basins, dynamic scheduling, alternative weights, and Pareto-based extensions.</description>
	<pubDate>2026-08-03</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 752: A Scalarized Weighted-Sum Hybrid GA&amp;ndash;PSO Decision-Support Framework for Constrained Water Resource Scheduling</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/752">doi: 10.3390/info17080752</a></p>
	<p>Authors:
		Mehmet Akif Cifci
		Yousef Farhang
		Batuhan Öney
		Ziya Gökalp Ersan
		Fazlı Yıldırım
		Uğur Akbulut
		</p>
	<p>Water resource management increasingly requires allocation methods that address rising demand, climate variability, and operational inefficiency. This study proposes an elite-transfer hybrid Genetic Algorithm&amp;amp;ndash;Particle Swarm Optimization framework for constrained water allocation under a weighted-sum scalarization model. The model combines four normalized objectives: minimizing water shortage, an operational cost coefficient, and allocation imbalance while maximizing utilization efficiency through an equivalent minimization term. A bidirectional elite-transfer mechanism links GA-based global exploration with PSO-based local refinement. The framework was evaluated using two capacity-constrained surrogate scenarios anchored to hydrometeorological records from T&amp;amp;uuml;rkiye: Melekbah&amp;amp;ccedil;e station (E21A033) in the Upper Euphrates Basin and Be&amp;amp;#351;de&amp;amp;#287;irmen station (E12A003) in the Sakarya Basin. Daily streamflow records supported scenario construction, while precipitation and air-temperature data characterized local conditions. The proposed method was compared with standalone GA and standalone PSO, Differential Evolution, Grey Wolf Optimizer, a scalarized NSGA-II, adapted Kao&amp;amp;ndash;Zahara and Garg GA&amp;amp;ndash;PSO hybrids, and a no-elite ablation. All methods used the same objective formulation, normalization bounds, constraint-repair procedure, equal objective weights, tuning protocol, paired random seeds, and a budget of 10,000 objective-function evaluations. Performance was assessed through 30 paired runs per scenario. The proposed framework achieved the lowest mean scalar fitness values&amp;amp;mdash;0.1670 for Melekbah&amp;amp;ccedil;e and 0.1752 for Be&amp;amp;#351;de&amp;amp;#287;irmen&amp;amp;mdash;and reached the predefined convergence region after averages of 4587 and 4780 evaluations, respectively. All fitness and convergence improvements remained significant after Holm correction. Paired rank-biserial correlations ranged from 0.957 to 1.000 against the seven general comparators and were 0.824 and 0.781 against the no-elite ablation. The findings support the framework under the tested surrogate scenarios but do not establish Pareto-front dominance or universal superiority. Future work should examine measured operational data, additional basins, dynamic scheduling, alternative weights, and Pareto-based extensions.</p>
	]]></content:encoded>

	<dc:title>A Scalarized Weighted-Sum Hybrid GA&amp;amp;ndash;PSO Decision-Support Framework for Constrained Water Resource Scheduling</dc:title>
			<dc:creator>Mehmet Akif Cifci</dc:creator>
			<dc:creator>Yousef Farhang</dc:creator>
			<dc:creator>Batuhan Öney</dc:creator>
			<dc:creator>Ziya Gökalp Ersan</dc:creator>
			<dc:creator>Fazlı Yıldırım</dc:creator>
			<dc:creator>Uğur Akbulut</dc:creator>
		<dc:identifier>doi: 10.3390/info17080752</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-03</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-03</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>752</prism:startingPage>
		<prism:doi>10.3390/info17080752</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/752</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/751">

	<title>Information, Vol. 17, Pages 751: A Comparative Evaluation of Deep Learning Architectures for Weed Classification, with an Exploratory Out-of-Distribution Analysis of Albanian Field Images</title>
	<link>https://www.mdpi.com/2078-2489/17/8/751</link>
	<description>Automated weed classification supports site-specific weed management by enabling targeted interventions and reducing environmental and operational costs. This study presents a multi-seed evaluation of six deep learning configurations&amp;amp;mdash;YOLO26n-cls, Vision Transformer (ViT-B/16), DINOv2 (ViT-S/14) with linear probing and full fine-tuning, ResNet-50, and EfficientNet-B0&amp;amp;mdash;for nine-class weed classification using a stratified subset of the DeepWeeds benchmark. The models were evaluated using a leakage-checked train/validation/test split and repeated training across multiple random seeds to assess performance stability and statistical reliability. Among the evaluated approaches, DINOv2-FT and EfficientNet-B0 demonstrated the strongest overall performance, while statistical analysis showed that differences among several high-performing models were not consistently significant across seeds. The study also identifies the importance of appropriate transfer-learning strategies and hyperparameter selection, demonstrating that model performance can be strongly affected by optimisation choices. A reproducibility issue affecting ViT-B/16 was identified and transparently reported, leading to its exclusion from multi-seed statistical comparisons. An exploratory out-of-distribution probe using unlabelled Albanian field images further highlights the challenges of geographic domain shift and the need for locally collected, labelled datasets before reliable regional deployment. Overall, this work provides a systematic comparison of modern deep learning architectures for weed classification and emphasises reproducibility, statistical validation, and careful interpretation of model rankings.</description>
	<pubDate>2026-08-02</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 751: A Comparative Evaluation of Deep Learning Architectures for Weed Classification, with an Exploratory Out-of-Distribution Analysis of Albanian Field Images</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/751">doi: 10.3390/info17080751</a></p>
	<p>Authors:
		Rajesh Kumar
		Narasimha Rao Vajjhala
		Ervin Ramollari
		Earta Joca
		</p>
	<p>Automated weed classification supports site-specific weed management by enabling targeted interventions and reducing environmental and operational costs. This study presents a multi-seed evaluation of six deep learning configurations&amp;amp;mdash;YOLO26n-cls, Vision Transformer (ViT-B/16), DINOv2 (ViT-S/14) with linear probing and full fine-tuning, ResNet-50, and EfficientNet-B0&amp;amp;mdash;for nine-class weed classification using a stratified subset of the DeepWeeds benchmark. The models were evaluated using a leakage-checked train/validation/test split and repeated training across multiple random seeds to assess performance stability and statistical reliability. Among the evaluated approaches, DINOv2-FT and EfficientNet-B0 demonstrated the strongest overall performance, while statistical analysis showed that differences among several high-performing models were not consistently significant across seeds. The study also identifies the importance of appropriate transfer-learning strategies and hyperparameter selection, demonstrating that model performance can be strongly affected by optimisation choices. A reproducibility issue affecting ViT-B/16 was identified and transparently reported, leading to its exclusion from multi-seed statistical comparisons. An exploratory out-of-distribution probe using unlabelled Albanian field images further highlights the challenges of geographic domain shift and the need for locally collected, labelled datasets before reliable regional deployment. Overall, this work provides a systematic comparison of modern deep learning architectures for weed classification and emphasises reproducibility, statistical validation, and careful interpretation of model rankings.</p>
	]]></content:encoded>

	<dc:title>A Comparative Evaluation of Deep Learning Architectures for Weed Classification, with an Exploratory Out-of-Distribution Analysis of Albanian Field Images</dc:title>
			<dc:creator>Rajesh Kumar</dc:creator>
			<dc:creator>Narasimha Rao Vajjhala</dc:creator>
			<dc:creator>Ervin Ramollari</dc:creator>
			<dc:creator>Earta Joca</dc:creator>
		<dc:identifier>doi: 10.3390/info17080751</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-02</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-02</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>751</prism:startingPage>
		<prism:doi>10.3390/info17080751</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/751</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/750">

	<title>Information, Vol. 17, Pages 750: Frameworks for Adaptive Smart Urban Systems: A Bibliometric Analysis and Systematic Literature Review</title>
	<link>https://www.mdpi.com/2078-2489/17/8/750</link>
	<description>The sustained growth of urban areas has increased the complexity of managing services, infrastructure, and mobility, creating a need for advanced technological solutions capable of responding dynamically to rapidly changing environments. In this context, adaptive smart urban systems have emerged as an innovative alternative that integrates artificial intelligence (AI) to optimize real-time decision making. This study presents a systematic literature review and bibliometric analysis of 64 scientific articles focused on the frameworks underpinning these systems. The methodology applied is based on the selection and critical analysis of indexed scientific publications, enabling the identification of predominant approaches such as machine learning, deep learning, multi-agent systems, and reinforcement learning. The findings reveal a strong convergence between AI, the Internet of Things (IoT), and Big Data, as well as significant limitations in terms of interoperability, data governance, and scalability. It is concluded that, while the advances are promising, the consolidation of these systems requires a comprehensive approach that combines technological innovation, appropriate regulation, and social sustainability.</description>
	<pubDate>2026-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 750: Frameworks for Adaptive Smart Urban Systems: A Bibliometric Analysis and Systematic Literature Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/750">doi: 10.3390/info17080750</a></p>
	<p>Authors:
		Gary Reyes
		Roberto Tolozano-Benites
		Jorge Reyes
		Laura Lanzarini
		Waldo Hasperué
		Dayron Rumbaut
		Julio Barzola-Monteses
		Carlos George-Reyes
		</p>
	<p>The sustained growth of urban areas has increased the complexity of managing services, infrastructure, and mobility, creating a need for advanced technological solutions capable of responding dynamically to rapidly changing environments. In this context, adaptive smart urban systems have emerged as an innovative alternative that integrates artificial intelligence (AI) to optimize real-time decision making. This study presents a systematic literature review and bibliometric analysis of 64 scientific articles focused on the frameworks underpinning these systems. The methodology applied is based on the selection and critical analysis of indexed scientific publications, enabling the identification of predominant approaches such as machine learning, deep learning, multi-agent systems, and reinforcement learning. The findings reveal a strong convergence between AI, the Internet of Things (IoT), and Big Data, as well as significant limitations in terms of interoperability, data governance, and scalability. It is concluded that, while the advances are promising, the consolidation of these systems requires a comprehensive approach that combines technological innovation, appropriate regulation, and social sustainability.</p>
	]]></content:encoded>

	<dc:title>Frameworks for Adaptive Smart Urban Systems: A Bibliometric Analysis and Systematic Literature Review</dc:title>
			<dc:creator>Gary Reyes</dc:creator>
			<dc:creator>Roberto Tolozano-Benites</dc:creator>
			<dc:creator>Jorge Reyes</dc:creator>
			<dc:creator>Laura Lanzarini</dc:creator>
			<dc:creator>Waldo Hasperué</dc:creator>
			<dc:creator>Dayron Rumbaut</dc:creator>
			<dc:creator>Julio Barzola-Monteses</dc:creator>
			<dc:creator>Carlos George-Reyes</dc:creator>
		<dc:identifier>doi: 10.3390/info17080750</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Systematic Review</prism:section>
	<prism:startingPage>750</prism:startingPage>
		<prism:doi>10.3390/info17080750</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/750</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/749">

	<title>Information, Vol. 17, Pages 749: A Clinician-in-the-Loop Framework for Validating and Selecting Synthetic Paediatric Dermatology Images</title>
	<link>https://www.mdpi.com/2078-2489/17/8/749</link>
	<description>Synthetic data are increasingly proposed as a strategy for addressing data scarcity and representation imbalance in medical AI, particularly for paediatric populations and darker skin tones. However, visually plausible synthetic images may still contain clinically implausible features or fairness-relevant inconsistencies that are not adequately captured by automatic image-quality metrics. In this study, we present and empirically evaluate a clinician-guided framework for validating and selecting synthetic paediatric dermatology images. The framework combines a clinician-facing evaluation platform with structured assessments of visual realism, mask quality, diagnostic plausibility, confidence, and skin-tone relevance. Four clinicians with complementary expertise in paediatrics and dermatology completed 282 assessments of 93 real and synthetic images. Synthetic images were often rated as visually realistic but showed lower inter-rater agreement and weaker mask-quality assessments than real images. Clinician realism and confidence ratings were then used to divide 30 synthetic images into 18 approved and 12 non-approved images. To assess downstream utility, we compared a real-only ResNet50 classifier with classifiers augmented using all synthetic images, clinician-approved synthetic images, or non-approved synthetic images. Across three patient-level experimental splits, the clinician-approved condition achieved the strongest overall classification performance and the largest gains for the under-represented Dark-Skin subgroup. Because the Dark-Skin subgroup contained only seven patients and the synthetic subsets differed in size and disease composition, these fairness results should be interpreted as exploratory. The present study therefore provides evidence for clinician-guided validation and data curation rather than for a completed iterative generator-retraining process. Future work will evaluate whether clinician feedback can also support repeated generative-model refinement in larger, multi-centre datasets.</description>
	<pubDate>2026-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 749: A Clinician-in-the-Loop Framework for Validating and Selecting Synthetic Paediatric Dermatology Images</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/749">doi: 10.3390/info17080749</a></p>
	<p>Authors:
		Ali Tariq Nagi
		Chiara Bellatreccia
		Andrea Borghesi
		Arianna Dondi
		Luca Pierantoni
		Daniele Zama
		Iria Neri
		Marcello Lanari
		Roberta Calegari
		</p>
	<p>Synthetic data are increasingly proposed as a strategy for addressing data scarcity and representation imbalance in medical AI, particularly for paediatric populations and darker skin tones. However, visually plausible synthetic images may still contain clinically implausible features or fairness-relevant inconsistencies that are not adequately captured by automatic image-quality metrics. In this study, we present and empirically evaluate a clinician-guided framework for validating and selecting synthetic paediatric dermatology images. The framework combines a clinician-facing evaluation platform with structured assessments of visual realism, mask quality, diagnostic plausibility, confidence, and skin-tone relevance. Four clinicians with complementary expertise in paediatrics and dermatology completed 282 assessments of 93 real and synthetic images. Synthetic images were often rated as visually realistic but showed lower inter-rater agreement and weaker mask-quality assessments than real images. Clinician realism and confidence ratings were then used to divide 30 synthetic images into 18 approved and 12 non-approved images. To assess downstream utility, we compared a real-only ResNet50 classifier with classifiers augmented using all synthetic images, clinician-approved synthetic images, or non-approved synthetic images. Across three patient-level experimental splits, the clinician-approved condition achieved the strongest overall classification performance and the largest gains for the under-represented Dark-Skin subgroup. Because the Dark-Skin subgroup contained only seven patients and the synthetic subsets differed in size and disease composition, these fairness results should be interpreted as exploratory. The present study therefore provides evidence for clinician-guided validation and data curation rather than for a completed iterative generator-retraining process. Future work will evaluate whether clinician feedback can also support repeated generative-model refinement in larger, multi-centre datasets.</p>
	]]></content:encoded>

	<dc:title>A Clinician-in-the-Loop Framework for Validating and Selecting Synthetic Paediatric Dermatology Images</dc:title>
			<dc:creator>Ali Tariq Nagi</dc:creator>
			<dc:creator>Chiara Bellatreccia</dc:creator>
			<dc:creator>Andrea Borghesi</dc:creator>
			<dc:creator>Arianna Dondi</dc:creator>
			<dc:creator>Luca Pierantoni</dc:creator>
			<dc:creator>Daniele Zama</dc:creator>
			<dc:creator>Iria Neri</dc:creator>
			<dc:creator>Marcello Lanari</dc:creator>
			<dc:creator>Roberta Calegari</dc:creator>
		<dc:identifier>doi: 10.3390/info17080749</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>749</prism:startingPage>
		<prism:doi>10.3390/info17080749</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/749</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/748">

	<title>Information, Vol. 17, Pages 748: Fourier-Based Adaptive Spectral Synthesis: Decision-Making with Imbalanced Management Data</title>
	<link>https://www.mdpi.com/2078-2489/17/8/748</link>
	<description>Artificial intelligence applications in management, such as fraud detection and churn prediction, are frequently constrained by the class imbalance problem. Standard over-sampling methods, such as SMOTE, rely on local geometric interpolation, which assumes data convexity and struggles to model the disjoint structures typical of managerial datasets. We introduce Fourier-based Adaptive Spectral Synthesis (FASS), an over-sampling method that frames data generation as a signal reconstruction problem. By transforming the minority class data into the frequency domain via the empirical characteristic function, FASS isolates the global manifold structure from high-frequency sampling noise through an automated spectral filtering mechanism. We prove the L2-consistency of the underlying estimator. Empirical evaluations on credit and marketing datasets demonstrate that FASS favorably shifts the precision&amp;amp;ndash;recall trade-off compared to geometric baselines, reducing false positives and providing a theoretically consistent, parameter-free approach to learning from imbalanced data.</description>
	<pubDate>2026-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 748: Fourier-Based Adaptive Spectral Synthesis: Decision-Making with Imbalanced Management Data</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/748">doi: 10.3390/info17080748</a></p>
	<p>Authors:
		Firuz Kamalov
		Ahmed El Sayed
		Ikhlaas Gurrib
		Kweh Qian Long
		Ji Yeh Choi
		Ghassan Malkawi
		</p>
	<p>Artificial intelligence applications in management, such as fraud detection and churn prediction, are frequently constrained by the class imbalance problem. Standard over-sampling methods, such as SMOTE, rely on local geometric interpolation, which assumes data convexity and struggles to model the disjoint structures typical of managerial datasets. We introduce Fourier-based Adaptive Spectral Synthesis (FASS), an over-sampling method that frames data generation as a signal reconstruction problem. By transforming the minority class data into the frequency domain via the empirical characteristic function, FASS isolates the global manifold structure from high-frequency sampling noise through an automated spectral filtering mechanism. We prove the L2-consistency of the underlying estimator. Empirical evaluations on credit and marketing datasets demonstrate that FASS favorably shifts the precision&amp;amp;ndash;recall trade-off compared to geometric baselines, reducing false positives and providing a theoretically consistent, parameter-free approach to learning from imbalanced data.</p>
	]]></content:encoded>

	<dc:title>Fourier-Based Adaptive Spectral Synthesis: Decision-Making with Imbalanced Management Data</dc:title>
			<dc:creator>Firuz Kamalov</dc:creator>
			<dc:creator>Ahmed El Sayed</dc:creator>
			<dc:creator>Ikhlaas Gurrib</dc:creator>
			<dc:creator>Kweh Qian Long</dc:creator>
			<dc:creator>Ji Yeh Choi</dc:creator>
			<dc:creator>Ghassan Malkawi</dc:creator>
		<dc:identifier>doi: 10.3390/info17080748</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>748</prism:startingPage>
		<prism:doi>10.3390/info17080748</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/748</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/747">

	<title>Information, Vol. 17, Pages 747: FDDP-RN: Frequency-Domain Denoising and Popularity Bias Correction Recommendation Network</title>
	<link>https://www.mdpi.com/2078-2489/17/8/747</link>
	<description>News recommendation is a critical technology that helps users efficiently find content of interest from large candidate pools. Its core objective is to accurately model user reading interests. However, current news recommendation systems typically suffer from two key limitations: (i) they fail to suppress noise from a frequency-domain perspective, and (ii) they lack effective calibration for popularity bias within the embedding space. In this work, we propose a novel frequency-domain denoising and popularity-bias correction recommendation network (FDDP-RN) to address both challenges simultaneously. Our approach introduces spectral analysis into the news encoder. Specifically, we design a filtering mechanism that combines truncation and scaling to enhance high-frequency semantic components, improve text feature representation accuracy, and suppress redundant low-frequency components. In addition, we introduce a norm-scaling factor that dynamically calibrates the embedding distribution of cold-start news items, placing them on an equal footing with popular news items. This effectively improves the exposure of long-tail content without requiring extra user interactions. We conduct extensive experiments on three public datasets, namely, MIND-small, MIND-large, and Adressa. The quantitative results demonstrate that FDDP-RN achieves state-of-the-art performance. Notably, on the Adressa dataset, our model achieves an AUC of 75.36% and an nDCG@10 of 50.11%, outperforming the strongest baseline. Furthermore, cold-start fairness diagnostics on the MIND-small dataset reveal that our mechanism increases the top-10 long-tail exposure rate from 15.3% to 18.1% and reduces the exposure Gini coefficient from 0.991 to 0.987, indicating a better balance among recommendation accuracy, diversity, and fairness.</description>
	<pubDate>2026-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 747: FDDP-RN: Frequency-Domain Denoising and Popularity Bias Correction Recommendation Network</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/747">doi: 10.3390/info17080747</a></p>
	<p>Authors:
		Xiaohui Du
		Yiwei Deng
		Xuelin Wang
		Biyang Ma
		Huifan Gao
		</p>
	<p>News recommendation is a critical technology that helps users efficiently find content of interest from large candidate pools. Its core objective is to accurately model user reading interests. However, current news recommendation systems typically suffer from two key limitations: (i) they fail to suppress noise from a frequency-domain perspective, and (ii) they lack effective calibration for popularity bias within the embedding space. In this work, we propose a novel frequency-domain denoising and popularity-bias correction recommendation network (FDDP-RN) to address both challenges simultaneously. Our approach introduces spectral analysis into the news encoder. Specifically, we design a filtering mechanism that combines truncation and scaling to enhance high-frequency semantic components, improve text feature representation accuracy, and suppress redundant low-frequency components. In addition, we introduce a norm-scaling factor that dynamically calibrates the embedding distribution of cold-start news items, placing them on an equal footing with popular news items. This effectively improves the exposure of long-tail content without requiring extra user interactions. We conduct extensive experiments on three public datasets, namely, MIND-small, MIND-large, and Adressa. The quantitative results demonstrate that FDDP-RN achieves state-of-the-art performance. Notably, on the Adressa dataset, our model achieves an AUC of 75.36% and an nDCG@10 of 50.11%, outperforming the strongest baseline. Furthermore, cold-start fairness diagnostics on the MIND-small dataset reveal that our mechanism increases the top-10 long-tail exposure rate from 15.3% to 18.1% and reduces the exposure Gini coefficient from 0.991 to 0.987, indicating a better balance among recommendation accuracy, diversity, and fairness.</p>
	]]></content:encoded>

	<dc:title>FDDP-RN: Frequency-Domain Denoising and Popularity Bias Correction Recommendation Network</dc:title>
			<dc:creator>Xiaohui Du</dc:creator>
			<dc:creator>Yiwei Deng</dc:creator>
			<dc:creator>Xuelin Wang</dc:creator>
			<dc:creator>Biyang Ma</dc:creator>
			<dc:creator>Huifan Gao</dc:creator>
		<dc:identifier>doi: 10.3390/info17080747</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>747</prism:startingPage>
		<prism:doi>10.3390/info17080747</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/747</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/746">

	<title>Information, Vol. 17, Pages 746: Tissue-State-Dependent Near-Infrared Spectral Responses and SSC Prediction Stability in Navel Orange</title>
	<link>https://www.mdpi.com/2078-2489/17/8/746</link>
	<description>The near-infrared (NIR) spectral responses under different tissue states are important for nondestructive soluble solids content (SSC) assessment of thick-peeled citrus, but the effects of peel removal and progressive tissue exposure remain unclear. Diffuse reflectance and transmittance spectra of Zigui navel oranges were collected at 650&amp;amp;ndash;1050 nm under four sequential states: intact fruit, first-slice fruit, second-slice fruit, and half fruit. Raw, first-derivative, and second-derivative spectra were analyzed using wavelength-wise paired tests, effect-size summaries, empirical response indices, and repeated validation of SSC prediction models. Slicing clearly altered the NIR spectral profiles, although these changes should not be interpreted as direct measurements of physical penetration depth. Diffuse reflectance spectra were more sensitive to surface-related changes, whereas transmittance spectra reflected cumulative optical-path responses. In 100 repeated stratified random splits, intact-fruit spectra showed only an average tendency toward more stable SSC prediction. Absolute prediction accuracy was weak for all tissue states, with the highest mean R2p being only 0.262 for intact fruit and negative mean R2p values for the other states. Thus, increased tissue exposure did not improve model generalization. This study mainly clarifies tissue-state-dependent spectral responses and provides a cautionary reference for SSC prediction in thick-peeled citrus.</description>
	<pubDate>2026-08-01</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 746: Tissue-State-Dependent Near-Infrared Spectral Responses and SSC Prediction Stability in Navel Orange</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/746">doi: 10.3390/info17080746</a></p>
	<p>Authors:
		Zijing Cai
		Peixuan Li
		Jingwen Xu
		Shinan Li
		Jianan Song
		Jie Liu
		</p>
	<p>The near-infrared (NIR) spectral responses under different tissue states are important for nondestructive soluble solids content (SSC) assessment of thick-peeled citrus, but the effects of peel removal and progressive tissue exposure remain unclear. Diffuse reflectance and transmittance spectra of Zigui navel oranges were collected at 650&amp;amp;ndash;1050 nm under four sequential states: intact fruit, first-slice fruit, second-slice fruit, and half fruit. Raw, first-derivative, and second-derivative spectra were analyzed using wavelength-wise paired tests, effect-size summaries, empirical response indices, and repeated validation of SSC prediction models. Slicing clearly altered the NIR spectral profiles, although these changes should not be interpreted as direct measurements of physical penetration depth. Diffuse reflectance spectra were more sensitive to surface-related changes, whereas transmittance spectra reflected cumulative optical-path responses. In 100 repeated stratified random splits, intact-fruit spectra showed only an average tendency toward more stable SSC prediction. Absolute prediction accuracy was weak for all tissue states, with the highest mean R2p being only 0.262 for intact fruit and negative mean R2p values for the other states. Thus, increased tissue exposure did not improve model generalization. This study mainly clarifies tissue-state-dependent spectral responses and provides a cautionary reference for SSC prediction in thick-peeled citrus.</p>
	]]></content:encoded>

	<dc:title>Tissue-State-Dependent Near-Infrared Spectral Responses and SSC Prediction Stability in Navel Orange</dc:title>
			<dc:creator>Zijing Cai</dc:creator>
			<dc:creator>Peixuan Li</dc:creator>
			<dc:creator>Jingwen Xu</dc:creator>
			<dc:creator>Shinan Li</dc:creator>
			<dc:creator>Jianan Song</dc:creator>
			<dc:creator>Jie Liu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080746</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-08-01</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-08-01</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>746</prism:startingPage>
		<prism:doi>10.3390/info17080746</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/746</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/745">

	<title>Information, Vol. 17, Pages 745: Cross-Family Stem-Suffix Boundary Segmentation in Turkic and Uralic Languages: A ByT5 Study of Azerbaijani, Turkish, Hungarian, and Finnish</title>
	<link>https://www.mdpi.com/2078-2489/17/8/745</link>
	<description>Turkic and Uralic languages share almost everything except ancestry: both are agglutinative, both stack long suffix chains onto a stem, both use vowel harmony, and both put the verb last. That coincidence is what makes the pairing worth testing. If a neural model learns where to place a stem&amp;amp;ndash;suffix boundary in one family, does the skill carry over to the other, given that nothing but structure is shared? We fine-tuned ByT5-small, a byte-level encoder&amp;amp;ndash;decoder, on segmentation pairs built from UniMorph 4.0 and Universal Dependencies for Azerbaijani, Turkish, Hungarian, and Finnish. To our knowledge, no earlier segmentation benchmark covers these four languages together, and the SIGMORPHON 2022 shared task included only Hungarian among them. These targets contain exactly one boundary at most, a stem plus one undivided suffix block, so the supervised task is single-boundary segmentation, not full morpheme decomposition. On this task, in-domain exact match is high across a 4&amp;amp;times;4 train-on-one, test-on-another matrix run over three seeds, 0.91 to 0.98, against a copy-input baseline of 0.02 to 0.20. Cross-family transfer is not: Finnish-to-Azerbaijani reaches 0.640 against 0.208 the other way (p&amp;amp;lt;10&amp;amp;minus;66), and an exploratory reading of the twelve pairs suggests surface typology tracks this gap more closely than genealogy does, though one high-overlap pair dominates and the sample is too small to settle the question. The central finding comes from a multi-boundary stress test: on 800 words we hand-annotated from Wikipedia (model-correctness agreement was perfect, Cohen&amp;amp;rsquo;s &amp;amp;kappa;=1.00), the models stall at two morphemes, and the 37% of words with three or more come out almost entirely wrong (one correct prediction in 897). Boundary-level scoring shows the shape of the failure: precision stays high, up to 0.97, while recall drops to 0.39&amp;amp;ndash;0.52, so the boundaries the models place are mostly right, they just place far too few. This ceiling is consistent with the two-part training targets rather than with the byte-level architecture, although only one architecture under one supervision regime was tested, so confirming the attribution will take retraining on fully decomposed targets. We release all code, data, and annotations to support that step.</description>
	<pubDate>2026-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 745: Cross-Family Stem-Suffix Boundary Segmentation in Turkic and Uralic Languages: A ByT5 Study of Azerbaijani, Turkish, Hungarian, and Finnish</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/745">doi: 10.3390/info17080745</a></p>
	<p>Authors:
		Kamran Ibiyev
		</p>
	<p>Turkic and Uralic languages share almost everything except ancestry: both are agglutinative, both stack long suffix chains onto a stem, both use vowel harmony, and both put the verb last. That coincidence is what makes the pairing worth testing. If a neural model learns where to place a stem&amp;amp;ndash;suffix boundary in one family, does the skill carry over to the other, given that nothing but structure is shared? We fine-tuned ByT5-small, a byte-level encoder&amp;amp;ndash;decoder, on segmentation pairs built from UniMorph 4.0 and Universal Dependencies for Azerbaijani, Turkish, Hungarian, and Finnish. To our knowledge, no earlier segmentation benchmark covers these four languages together, and the SIGMORPHON 2022 shared task included only Hungarian among them. These targets contain exactly one boundary at most, a stem plus one undivided suffix block, so the supervised task is single-boundary segmentation, not full morpheme decomposition. On this task, in-domain exact match is high across a 4&amp;amp;times;4 train-on-one, test-on-another matrix run over three seeds, 0.91 to 0.98, against a copy-input baseline of 0.02 to 0.20. Cross-family transfer is not: Finnish-to-Azerbaijani reaches 0.640 against 0.208 the other way (p&amp;amp;lt;10&amp;amp;minus;66), and an exploratory reading of the twelve pairs suggests surface typology tracks this gap more closely than genealogy does, though one high-overlap pair dominates and the sample is too small to settle the question. The central finding comes from a multi-boundary stress test: on 800 words we hand-annotated from Wikipedia (model-correctness agreement was perfect, Cohen&amp;amp;rsquo;s &amp;amp;kappa;=1.00), the models stall at two morphemes, and the 37% of words with three or more come out almost entirely wrong (one correct prediction in 897). Boundary-level scoring shows the shape of the failure: precision stays high, up to 0.97, while recall drops to 0.39&amp;amp;ndash;0.52, so the boundaries the models place are mostly right, they just place far too few. This ceiling is consistent with the two-part training targets rather than with the byte-level architecture, although only one architecture under one supervision regime was tested, so confirming the attribution will take retraining on fully decomposed targets. We release all code, data, and annotations to support that step.</p>
	]]></content:encoded>

	<dc:title>Cross-Family Stem-Suffix Boundary Segmentation in Turkic and Uralic Languages: A ByT5 Study of Azerbaijani, Turkish, Hungarian, and Finnish</dc:title>
			<dc:creator>Kamran Ibiyev</dc:creator>
		<dc:identifier>doi: 10.3390/info17080745</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-31</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-31</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>745</prism:startingPage>
		<prism:doi>10.3390/info17080745</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/745</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/744">

	<title>Information, Vol. 17, Pages 744: AI-Based Assessment of Revision-Associated Research Writing Development in a Peer-Feedback-Supported</title>
	<link>https://www.mdpi.com/2078-2489/17/8/744</link>
	<description>Despite its ubiquity as a writerly practice in academic writing, there is little publicly available evidence that connects feedback-based revision practices with quantitative changes in research writing. This study proposes a framework based on artificial intelligence (AI) that aids in the assessment of revision-related development in student research expos&amp;amp;eacute;s based on the Expos&amp;amp;iacute;a academic writing and peer-feedback corpus (Ec). The raw files analyzed included 3247 records, with 16,068 feedback and comment records, 55 matched draft&amp;amp;ndash;final pairs of expos&amp;amp;eacute;s, and 28 matched draft&amp;amp;ndash;final pairs of cases by score. For every text, features of NLP were computed, such as: word count, type&amp;amp;ndash;token ratio, moving-average type&amp;amp;ndash;token ratio over 100-word windows (MATTR-100), lexical density, readability, and adjacent-sentence cohesion. The differences between the draft and the final text were analyzed with paired statistical tests, and the human assessment scores were estimated using draft-Ridge Regression and draft-Random Forest models. Human assessment scores increased significantly from the draft (M = 5.26) to the final version (M = 7.55), t(27) = 9.04, p &amp;amp;lt; 0.001, Cohen&amp;amp;rsquo;s dz = 1.709. There was also a significant increase in word count, MATTR-100, and lexical density. Random Forest gave a better R2 (0.426) than Ridge Regression (R2 = 0.248). The exploratory feedback-improvement model resulted in a negative R2 due to a limited number of automatically merged feedback features, a lack of alignment between comment and revision, and a small number of matched scores. Therefore, AI-supported analysis identified writing development associated with revision and captured human judgment to some extent, but did not provide causal evidence of the independent contribution of peer feedback to writing improvement due to the observational design. The framework offers a repeatable benchmark and calls for enhanced detail in providing feedback&amp;amp;ndash;revision alignment.</description>
	<pubDate>2026-07-31</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 744: AI-Based Assessment of Revision-Associated Research Writing Development in a Peer-Feedback-Supported</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/744">doi: 10.3390/info17080744</a></p>
	<p>Authors:
		Hamed Hilal AlYahmadi
		</p>
	<p>Despite its ubiquity as a writerly practice in academic writing, there is little publicly available evidence that connects feedback-based revision practices with quantitative changes in research writing. This study proposes a framework based on artificial intelligence (AI) that aids in the assessment of revision-related development in student research expos&amp;amp;eacute;s based on the Expos&amp;amp;iacute;a academic writing and peer-feedback corpus (Ec). The raw files analyzed included 3247 records, with 16,068 feedback and comment records, 55 matched draft&amp;amp;ndash;final pairs of expos&amp;amp;eacute;s, and 28 matched draft&amp;amp;ndash;final pairs of cases by score. For every text, features of NLP were computed, such as: word count, type&amp;amp;ndash;token ratio, moving-average type&amp;amp;ndash;token ratio over 100-word windows (MATTR-100), lexical density, readability, and adjacent-sentence cohesion. The differences between the draft and the final text were analyzed with paired statistical tests, and the human assessment scores were estimated using draft-Ridge Regression and draft-Random Forest models. Human assessment scores increased significantly from the draft (M = 5.26) to the final version (M = 7.55), t(27) = 9.04, p &amp;amp;lt; 0.001, Cohen&amp;amp;rsquo;s dz = 1.709. There was also a significant increase in word count, MATTR-100, and lexical density. Random Forest gave a better R2 (0.426) than Ridge Regression (R2 = 0.248). The exploratory feedback-improvement model resulted in a negative R2 due to a limited number of automatically merged feedback features, a lack of alignment between comment and revision, and a small number of matched scores. Therefore, AI-supported analysis identified writing development associated with revision and captured human judgment to some extent, but did not provide causal evidence of the independent contribution of peer feedback to writing improvement due to the observational design. The framework offers a repeatable benchmark and calls for enhanced detail in providing feedback&amp;amp;ndash;revision alignment.</p>
	]]></content:encoded>

	<dc:title>AI-Based Assessment of Revision-Associated Research Writing Development in a Peer-Feedback-Supported</dc:title>
			<dc:creator>Hamed Hilal AlYahmadi</dc:creator>
		<dc:identifier>doi: 10.3390/info17080744</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-31</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-31</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>744</prism:startingPage>
		<prism:doi>10.3390/info17080744</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/744</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/743">

	<title>Information, Vol. 17, Pages 743: Clustered-Support HE-PFL: Coarsening the Sparsity Side Channel for Cheap Encrypted Personalized Federated Learning</title>
	<link>https://www.mdpi.com/2078-2489/17/8/743</link>
	<description>Homomorphic encryption (HE) secure aggregation requires coordinate-aligned updates, whereas personalized federated learning (PFL) lets each client share a different parameter subset. Top-k sparsification widens this gap: per-client supports must be unioned and re-packed, exposing a data-dependent cleartext index. We propose Clustered-Support HE-PFL (CSS-FL), a two-phase protocol that clusters clients by their already-exposed Top-k support via k-means on binary indicator vectors. In an index phase, each cluster agrees on one shared sparse support by majority vote; in a value phase, clients encrypt exactly the agreed coordinates, which are aligned by construction and sum directly under CKKS, while non-shared coordinates remain local. Relative to full-union HE, the aggregation server gains no new information (clustering consumes only the routing indices Top-k already exposes), the only values ever decrypted are multi-client cluster means, and every party downstream of the server observes a coarse cluster-level index rather than per-client indices. On MNIST, Fashion-MNIST, and CIFAR-10 with K&amp;amp;isin;{2,4,8} clusters, LeNet (three seeds; five at the most heterogeneous setting) and ResNet-18 (three seeds), CSS-FL reduce CKKS encryption cost by 5.3&amp;amp;ndash;7.3&amp;amp;times; relative to a constructed Full-Union baseline at 0.25&amp;amp;ndash;0.5 the downstreamcleartext index footprint for K&amp;amp;le;4 (the server-visible index footprint is unchanged), with personalized accuracy comparable to established PFL baselines (though below Ditto on CIFAR-10), and transmits 5&amp;amp;ndash;7&amp;amp;times; fewer end-to-end bytes including ciphertext expansion. An aggregation-width sensitivity study shows that averaging &amp;amp;ge;4 updates, a width the protocol enforces via a minimum-cluster-size merge floor, collapses single-sample DLG reconstruction from 34.5 dB to &amp;amp;asymp;6 dB.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 743: Clustered-Support HE-PFL: Coarsening the Sparsity Side Channel for Cheap Encrypted Personalized Federated Learning</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/743">doi: 10.3390/info17080743</a></p>
	<p>Authors:
		Zhaobin Li
		Mingliang Mo
		Chenchong Du
		Zhanzhen Wei
		</p>
	<p>Homomorphic encryption (HE) secure aggregation requires coordinate-aligned updates, whereas personalized federated learning (PFL) lets each client share a different parameter subset. Top-k sparsification widens this gap: per-client supports must be unioned and re-packed, exposing a data-dependent cleartext index. We propose Clustered-Support HE-PFL (CSS-FL), a two-phase protocol that clusters clients by their already-exposed Top-k support via k-means on binary indicator vectors. In an index phase, each cluster agrees on one shared sparse support by majority vote; in a value phase, clients encrypt exactly the agreed coordinates, which are aligned by construction and sum directly under CKKS, while non-shared coordinates remain local. Relative to full-union HE, the aggregation server gains no new information (clustering consumes only the routing indices Top-k already exposes), the only values ever decrypted are multi-client cluster means, and every party downstream of the server observes a coarse cluster-level index rather than per-client indices. On MNIST, Fashion-MNIST, and CIFAR-10 with K&amp;amp;isin;{2,4,8} clusters, LeNet (three seeds; five at the most heterogeneous setting) and ResNet-18 (three seeds), CSS-FL reduce CKKS encryption cost by 5.3&amp;amp;ndash;7.3&amp;amp;times; relative to a constructed Full-Union baseline at 0.25&amp;amp;ndash;0.5 the downstreamcleartext index footprint for K&amp;amp;le;4 (the server-visible index footprint is unchanged), with personalized accuracy comparable to established PFL baselines (though below Ditto on CIFAR-10), and transmits 5&amp;amp;ndash;7&amp;amp;times; fewer end-to-end bytes including ciphertext expansion. An aggregation-width sensitivity study shows that averaging &amp;amp;ge;4 updates, a width the protocol enforces via a minimum-cluster-size merge floor, collapses single-sample DLG reconstruction from 34.5 dB to &amp;amp;asymp;6 dB.</p>
	]]></content:encoded>

	<dc:title>Clustered-Support HE-PFL: Coarsening the Sparsity Side Channel for Cheap Encrypted Personalized Federated Learning</dc:title>
			<dc:creator>Zhaobin Li</dc:creator>
			<dc:creator>Mingliang Mo</dc:creator>
			<dc:creator>Chenchong Du</dc:creator>
			<dc:creator>Zhanzhen Wei</dc:creator>
		<dc:identifier>doi: 10.3390/info17080743</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>743</prism:startingPage>
		<prism:doi>10.3390/info17080743</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/743</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/742">

	<title>Information, Vol. 17, Pages 742: Knowledge Graph&amp;ndash;AI Agent Collaborative Framework: A Case Study and Effectiveness Analysis of Higher Education Teaching Practice Based on an Integrated Teaching Platform</title>
	<link>https://www.mdpi.com/2078-2489/17/8/742</link>
	<description>With the rapid advancement of educational digitalization and generative artificial intelligence, knowledge graphs and AI agents have emerged as key technologies supporting smart higher education. To address challenges in current AI-assisted teaching, including insufficient support from structured knowledge systems, inadequate coordination across teaching processes, and delayed evaluation and feedback, this study proposes a collaborative framework integrating knowledge graphs and AI agents within an integrated teaching platform, and illustrates its integrated operational mechanism for knowledge organization, learning support, learning analytics, and teaching evaluation. Using the core course Nautical Navigation in the Navigation Technology Specialty at WHUT as a case study, the framework was implemented on the Chaoxing Smart Course Platform and applied to 459 students across two cohorts. The implementation achieved knowledge structuring and learning process visualization. The constructed course knowledge graph includes 336 knowledge points and more than 2700 associated learning resources and assessment items, while 30 instructional AI agents were developed and deployed to support different teaching and learning scenarios. The results indicate that the framework improves course knowledge organization, enhances student engagement and self-directed learning, enables visualization of learning processes and precision in teaching evaluation, and promotes a shift from experience-based to data-driven instructional decision-making. Compared with the previous cohort, students&amp;amp;rsquo; average daily learning time increased from 564 s to 618 s, participation rates in chapter quizzes, group discussions, and assignment completion all exceeded 90%, and more than 80% of respondents expressed willingness to continue using this learning model. The study provides a practical reference for AI-enabled teaching reform and digital transformation in higher education.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 742: Knowledge Graph&amp;ndash;AI Agent Collaborative Framework: A Case Study and Effectiveness Analysis of Higher Education Teaching Practice Based on an Integrated Teaching Platform</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/742">doi: 10.3390/info17080742</a></p>
	<p>Authors:
		Kang Liu
		Jinfeng Zhang
		Hongxu Guan
		Chang Zheng
		Xinying Yang
		</p>
	<p>With the rapid advancement of educational digitalization and generative artificial intelligence, knowledge graphs and AI agents have emerged as key technologies supporting smart higher education. To address challenges in current AI-assisted teaching, including insufficient support from structured knowledge systems, inadequate coordination across teaching processes, and delayed evaluation and feedback, this study proposes a collaborative framework integrating knowledge graphs and AI agents within an integrated teaching platform, and illustrates its integrated operational mechanism for knowledge organization, learning support, learning analytics, and teaching evaluation. Using the core course Nautical Navigation in the Navigation Technology Specialty at WHUT as a case study, the framework was implemented on the Chaoxing Smart Course Platform and applied to 459 students across two cohorts. The implementation achieved knowledge structuring and learning process visualization. The constructed course knowledge graph includes 336 knowledge points and more than 2700 associated learning resources and assessment items, while 30 instructional AI agents were developed and deployed to support different teaching and learning scenarios. The results indicate that the framework improves course knowledge organization, enhances student engagement and self-directed learning, enables visualization of learning processes and precision in teaching evaluation, and promotes a shift from experience-based to data-driven instructional decision-making. Compared with the previous cohort, students&amp;amp;rsquo; average daily learning time increased from 564 s to 618 s, participation rates in chapter quizzes, group discussions, and assignment completion all exceeded 90%, and more than 80% of respondents expressed willingness to continue using this learning model. The study provides a practical reference for AI-enabled teaching reform and digital transformation in higher education.</p>
	]]></content:encoded>

	<dc:title>Knowledge Graph&amp;amp;ndash;AI Agent Collaborative Framework: A Case Study and Effectiveness Analysis of Higher Education Teaching Practice Based on an Integrated Teaching Platform</dc:title>
			<dc:creator>Kang Liu</dc:creator>
			<dc:creator>Jinfeng Zhang</dc:creator>
			<dc:creator>Hongxu Guan</dc:creator>
			<dc:creator>Chang Zheng</dc:creator>
			<dc:creator>Xinying Yang</dc:creator>
		<dc:identifier>doi: 10.3390/info17080742</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>742</prism:startingPage>
		<prism:doi>10.3390/info17080742</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/742</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/741">

	<title>Information, Vol. 17, Pages 741: Technology-Mediated Public Speaking Interventions for Educational Training and Anxiety Treatment: A Comprehensive Review</title>
	<link>https://www.mdpi.com/2078-2489/17/8/741</link>
	<description>Public speaking training and public speaking anxiety (PSA) treatment increasingly rely on technology-mediated systems, including web, mobile, desktop, and immersive virtual reality (VR) tools. This comprehensive review identifies and maps information and communication technology (ICT)-based public speaking interventions for educational training and anxiety-oriented treatment, focusing on platform choice, audience simulation, feedback timing, physiological and behavioral sensing, therapeutic framing, practitioner involvement, and evaluation methods. A PRISMA-inspired process documented identification and screening across Scopus, Web of Science, PubMed, IEEE Xplore, and ERIC for English-language journal articles and conference papers published between 1 February 2015 and 1 February 2025. From 6602 records, 82 participant-validated studies were included. No formal risk-of-bias assessment was conducted. VR accounted for 82.93% of interventions, while research prototypes comprised 72.0% of the evidence base, demonstrating the field&amp;amp;rsquo;s strong emphasis on immersive and experimental development. At the same time, 64.6% of interventions provided no automated feedback and 36.6% used no physiological or behavioral sensing, highlighting opportunities for more responsive and data-informed systems. The findings can guide the development of future public-speaking training and treatment systems by highlighting recurring design components, promising implementation patterns, and priorities for stronger comparative validation.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 741: Technology-Mediated Public Speaking Interventions for Educational Training and Anxiety Treatment: A Comprehensive Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/741">doi: 10.3390/info17080741</a></p>
	<p>Authors:
		Dragoș-Ion Dogioiu
		Anca Andreea Morar
		Alin Dragoș Bogdan Moldoveanu
		Ana Magdalena Anghel
		Alexandru Ion Berceanu
		</p>
	<p>Public speaking training and public speaking anxiety (PSA) treatment increasingly rely on technology-mediated systems, including web, mobile, desktop, and immersive virtual reality (VR) tools. This comprehensive review identifies and maps information and communication technology (ICT)-based public speaking interventions for educational training and anxiety-oriented treatment, focusing on platform choice, audience simulation, feedback timing, physiological and behavioral sensing, therapeutic framing, practitioner involvement, and evaluation methods. A PRISMA-inspired process documented identification and screening across Scopus, Web of Science, PubMed, IEEE Xplore, and ERIC for English-language journal articles and conference papers published between 1 February 2015 and 1 February 2025. From 6602 records, 82 participant-validated studies were included. No formal risk-of-bias assessment was conducted. VR accounted for 82.93% of interventions, while research prototypes comprised 72.0% of the evidence base, demonstrating the field&amp;amp;rsquo;s strong emphasis on immersive and experimental development. At the same time, 64.6% of interventions provided no automated feedback and 36.6% used no physiological or behavioral sensing, highlighting opportunities for more responsive and data-informed systems. The findings can guide the development of future public-speaking training and treatment systems by highlighting recurring design components, promising implementation patterns, and priorities for stronger comparative validation.</p>
	]]></content:encoded>

	<dc:title>Technology-Mediated Public Speaking Interventions for Educational Training and Anxiety Treatment: A Comprehensive Review</dc:title>
			<dc:creator>Dragoș-Ion Dogioiu</dc:creator>
			<dc:creator>Anca Andreea Morar</dc:creator>
			<dc:creator>Alin Dragoș Bogdan Moldoveanu</dc:creator>
			<dc:creator>Ana Magdalena Anghel</dc:creator>
			<dc:creator>Alexandru Ion Berceanu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080741</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>741</prism:startingPage>
		<prism:doi>10.3390/info17080741</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/741</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/740">

	<title>Information, Vol. 17, Pages 740: Parameter Estimation Algorithm for Suppression Jamming Signals Based on an Improved YOLOv8</title>
	<link>https://www.mdpi.com/2078-2489/17/8/740</link>
	<description>In military confrontations, intentional suppression jamming can significantly degrade the reliability of friendly communication systems. By integrating conventional frequency hopping with spectrum sensing, cognitive frequency hopping technology can proactively avoid jammed frequency bands, thereby enhancing anti-jamming performance. This paper proposes a jamming detection and parameter estimation algorithm based on an improved YOLOv8 model. The proposed method extracts the time&amp;amp;ndash;frequency features of jamming signals and predicts their bounding boxes in time&amp;amp;ndash;frequency images. Based on the coordinates of the predicted bounding boxes, the center frequency, bandwidth, and temporal parameters of the jamming signals are estimated, thereby supporting spectrum sensing. Simulation results under MATLAB-generated signal conditions show that the proposed method achieves high detection accuracy and low mean squared relative error in the considered simulation scenarios. In addition, the proposed method maintains effective detection and parameter-estimation performance in composite jamming scenarios. This study provides a useful simulation-based reference for spectrum sensing in cognitive frequency hopping systems.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 740: Parameter Estimation Algorithm for Suppression Jamming Signals Based on an Improved YOLOv8</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/740">doi: 10.3390/info17080740</a></p>
	<p>Authors:
		Hangyu Yang
		Zhaoran He
		Lu Xu
		Rui Xue
		</p>
	<p>In military confrontations, intentional suppression jamming can significantly degrade the reliability of friendly communication systems. By integrating conventional frequency hopping with spectrum sensing, cognitive frequency hopping technology can proactively avoid jammed frequency bands, thereby enhancing anti-jamming performance. This paper proposes a jamming detection and parameter estimation algorithm based on an improved YOLOv8 model. The proposed method extracts the time&amp;amp;ndash;frequency features of jamming signals and predicts their bounding boxes in time&amp;amp;ndash;frequency images. Based on the coordinates of the predicted bounding boxes, the center frequency, bandwidth, and temporal parameters of the jamming signals are estimated, thereby supporting spectrum sensing. Simulation results under MATLAB-generated signal conditions show that the proposed method achieves high detection accuracy and low mean squared relative error in the considered simulation scenarios. In addition, the proposed method maintains effective detection and parameter-estimation performance in composite jamming scenarios. This study provides a useful simulation-based reference for spectrum sensing in cognitive frequency hopping systems.</p>
	]]></content:encoded>

	<dc:title>Parameter Estimation Algorithm for Suppression Jamming Signals Based on an Improved YOLOv8</dc:title>
			<dc:creator>Hangyu Yang</dc:creator>
			<dc:creator>Zhaoran He</dc:creator>
			<dc:creator>Lu Xu</dc:creator>
			<dc:creator>Rui Xue</dc:creator>
		<dc:identifier>doi: 10.3390/info17080740</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>740</prism:startingPage>
		<prism:doi>10.3390/info17080740</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/740</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/739">

	<title>Information, Vol. 17, Pages 739: New Efficient Decoder of Linear Block Codes Based on Information Sets, Hash Techniques, and Machine Learning Models</title>
	<link>https://www.mdpi.com/2078-2489/17/8/739</link>
	<description>Error-correcting codes improve the reliability of data exchanged between transmitters and receivers; achieving efficient and fast decoding is a major challenge. In this work, we propose an efficient, fast, and high-performing decoder named FastSyndISD. The first version of the proposed decoder uses hashing techniques to quickly find the information set that allows for error correction directly from the syndrome of the received word. Hashing information sets significantly reduce space complexity, instead of all correctable errors, compared to HSDec, LRDec, and EL-BoostDec. The second version utilizes a machine learning model (decision tree) to quickly find the information set that enables error correction directly from the syndrome of the received word. This second version does not require storing a hash table, since the information set is determined by a decision tree classifier model. The performance of the proposed decoder FastSyndISD is very encouraging regarding its bit error rate (BER). Indeed, it succeeds in correcting all errors whose weights are equal to or less than the correction capacity of the analyzed codes. Furthermore, a comparison with various other decoders highlights its effectiveness. A detailed study of its space complexity, its time complexity, and the factors influencing its performance has also been conducted, aiming to achieve an optimal BER while reducing computational time and memory usage. This comparison proves the significant success of the proposed decoder.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 739: New Efficient Decoder of Linear Block Codes Based on Information Sets, Hash Techniques, and Machine Learning Models</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/739">doi: 10.3390/info17080739</a></p>
	<p>Authors:
		Mohammed El Assad
		Said Nouh
		Seddiq El Kasmi Alaoui
		Mohamed Azzouazi
		</p>
	<p>Error-correcting codes improve the reliability of data exchanged between transmitters and receivers; achieving efficient and fast decoding is a major challenge. In this work, we propose an efficient, fast, and high-performing decoder named FastSyndISD. The first version of the proposed decoder uses hashing techniques to quickly find the information set that allows for error correction directly from the syndrome of the received word. Hashing information sets significantly reduce space complexity, instead of all correctable errors, compared to HSDec, LRDec, and EL-BoostDec. The second version utilizes a machine learning model (decision tree) to quickly find the information set that enables error correction directly from the syndrome of the received word. This second version does not require storing a hash table, since the information set is determined by a decision tree classifier model. The performance of the proposed decoder FastSyndISD is very encouraging regarding its bit error rate (BER). Indeed, it succeeds in correcting all errors whose weights are equal to or less than the correction capacity of the analyzed codes. Furthermore, a comparison with various other decoders highlights its effectiveness. A detailed study of its space complexity, its time complexity, and the factors influencing its performance has also been conducted, aiming to achieve an optimal BER while reducing computational time and memory usage. This comparison proves the significant success of the proposed decoder.</p>
	]]></content:encoded>

	<dc:title>New Efficient Decoder of Linear Block Codes Based on Information Sets, Hash Techniques, and Machine Learning Models</dc:title>
			<dc:creator>Mohammed El Assad</dc:creator>
			<dc:creator>Said Nouh</dc:creator>
			<dc:creator>Seddiq El Kasmi Alaoui</dc:creator>
			<dc:creator>Mohamed Azzouazi</dc:creator>
		<dc:identifier>doi: 10.3390/info17080739</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>739</prism:startingPage>
		<prism:doi>10.3390/info17080739</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/739</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/738">

	<title>Information, Vol. 17, Pages 738: Examining E-Learning System Success in Jordanian Higher Education: Extending the Information Systems Success Model with Monitoring Quality</title>
	<link>https://www.mdpi.com/2078-2489/17/8/738</link>
	<description>Higher education is increasingly digitalized, resulting in increased reliance on e-learning systems, and thus, e-learning system success should be sufficiently evaluated. However, students worldwide have shown unproductive e-learning use. Hence, the e-learning systems success model after the outbreak needs revision. To validate the e-learning systems success, the role of monitoring quality was examined in this study using current e-learning and information systems success models. Data from 600 students were analyzed with structural equation modelling (SEM) run by SMARTPLS 4. Results showed that user satisfaction was positively impacted by information quality, system quality and service quality but not by monitoring quality. Results further showed positive impact of user system use on student satisfaction, subsequently impacting student loyalty. Also, results showed user satisfaction significantly impacting learning effectiveness. This study enhances the information systems literature through the inclusion of monitoring quality into the DeLone and McLean information systems success model and through examining its impact on user satisfaction, loyalty intention, and learning effectiveness in e-learning environments.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 738: Examining E-Learning System Success in Jordanian Higher Education: Extending the Information Systems Success Model with Monitoring Quality</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/738">doi: 10.3390/info17080738</a></p>
	<p>Authors:
		Dmaithan Almajali
		Robin Kabha
		Salwa Al Majali
		Samer Adnan Abdel-Hadi
		Lina Ashour
		Mohamed Fouda
		Ala Saleh
		Maria Tarawneh
		</p>
	<p>Higher education is increasingly digitalized, resulting in increased reliance on e-learning systems, and thus, e-learning system success should be sufficiently evaluated. However, students worldwide have shown unproductive e-learning use. Hence, the e-learning systems success model after the outbreak needs revision. To validate the e-learning systems success, the role of monitoring quality was examined in this study using current e-learning and information systems success models. Data from 600 students were analyzed with structural equation modelling (SEM) run by SMARTPLS 4. Results showed that user satisfaction was positively impacted by information quality, system quality and service quality but not by monitoring quality. Results further showed positive impact of user system use on student satisfaction, subsequently impacting student loyalty. Also, results showed user satisfaction significantly impacting learning effectiveness. This study enhances the information systems literature through the inclusion of monitoring quality into the DeLone and McLean information systems success model and through examining its impact on user satisfaction, loyalty intention, and learning effectiveness in e-learning environments.</p>
	]]></content:encoded>

	<dc:title>Examining E-Learning System Success in Jordanian Higher Education: Extending the Information Systems Success Model with Monitoring Quality</dc:title>
			<dc:creator>Dmaithan Almajali</dc:creator>
			<dc:creator>Robin Kabha</dc:creator>
			<dc:creator>Salwa Al Majali</dc:creator>
			<dc:creator>Samer Adnan Abdel-Hadi</dc:creator>
			<dc:creator>Lina Ashour</dc:creator>
			<dc:creator>Mohamed Fouda</dc:creator>
			<dc:creator>Ala Saleh</dc:creator>
			<dc:creator>Maria Tarawneh</dc:creator>
		<dc:identifier>doi: 10.3390/info17080738</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>738</prism:startingPage>
		<prism:doi>10.3390/info17080738</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/738</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/737">

	<title>Information, Vol. 17, Pages 737: Interpretable Multimodal AI for Horizon-Specific Survival Prediction in Hepatocellular Carcinoma Using Transcriptomics and Caption-Based Histopathology</title>
	<link>https://www.mdpi.com/2078-2489/17/8/737</link>
	<description>Accurate survival prediction in Liver Hepatocellular Carcinoma (LIHC) remains challenging because outcomes are shaped by clinical, molecular, and morphological heterogeneity. Although multimodal learning may improve prognosis, the contribution of each modality across clinically relevant survival horizons remains unclear, and many existing approaches provide limited interpretability. We present an interpretable multimodal framework for LIHC survival prediction using clinical variables, transcriptomic profiles, and histopathology whole-slide images from the TCGA-LIHC cohort. Survival prediction was formulated as horizon-specific classification at 1-, 3-, and 5-year endpoints. Histopathology patches were converted into morphology-focused textual descriptions using a vision&amp;amp;ndash;language captioning framework, aggregated into patient-level summaries, and embedded as predictive features. Caption quality was evaluated using automated semantic metrics and expert pathological review. Multimodal fusion was performed using a leakage-aware out-of-fold stacking strategy. The best fusion configurations achieved ROC-AUC values of 0.70, 0.74, and 0.66 for 1-, 3-, and 5-year prediction, respectively. Genomic features provided the strongest standalone signal at 1 and 3 years, while histopathology-derived captions contributed most clearly when combined with genomics at 3 years. These findings show that multimodal benefit is horizon-dependent and depends on modality complementarity rather than simply adding more data sources.</description>
	<pubDate>2026-07-30</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 737: Interpretable Multimodal AI for Horizon-Specific Survival Prediction in Hepatocellular Carcinoma Using Transcriptomics and Caption-Based Histopathology</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/737">doi: 10.3390/info17080737</a></p>
	<p>Authors:
		Mayank Kapadia
		Mohammad Masum
		</p>
	<p>Accurate survival prediction in Liver Hepatocellular Carcinoma (LIHC) remains challenging because outcomes are shaped by clinical, molecular, and morphological heterogeneity. Although multimodal learning may improve prognosis, the contribution of each modality across clinically relevant survival horizons remains unclear, and many existing approaches provide limited interpretability. We present an interpretable multimodal framework for LIHC survival prediction using clinical variables, transcriptomic profiles, and histopathology whole-slide images from the TCGA-LIHC cohort. Survival prediction was formulated as horizon-specific classification at 1-, 3-, and 5-year endpoints. Histopathology patches were converted into morphology-focused textual descriptions using a vision&amp;amp;ndash;language captioning framework, aggregated into patient-level summaries, and embedded as predictive features. Caption quality was evaluated using automated semantic metrics and expert pathological review. Multimodal fusion was performed using a leakage-aware out-of-fold stacking strategy. The best fusion configurations achieved ROC-AUC values of 0.70, 0.74, and 0.66 for 1-, 3-, and 5-year prediction, respectively. Genomic features provided the strongest standalone signal at 1 and 3 years, while histopathology-derived captions contributed most clearly when combined with genomics at 3 years. These findings show that multimodal benefit is horizon-dependent and depends on modality complementarity rather than simply adding more data sources.</p>
	]]></content:encoded>

	<dc:title>Interpretable Multimodal AI for Horizon-Specific Survival Prediction in Hepatocellular Carcinoma Using Transcriptomics and Caption-Based Histopathology</dc:title>
			<dc:creator>Mayank Kapadia</dc:creator>
			<dc:creator>Mohammad Masum</dc:creator>
		<dc:identifier>doi: 10.3390/info17080737</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-30</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-30</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>737</prism:startingPage>
		<prism:doi>10.3390/info17080737</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/737</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/736">

	<title>Information, Vol. 17, Pages 736: An Expert Routing Method Based on Positive Sample Semantic Distribution via BGMM-LSE</title>
	<link>https://www.mdpi.com/2078-2489/17/8/736</link>
	<description>Multi-expert large language model systems need to dynamically distribute user requests among multiple candidate experts to improve inference accuracy and system efficiency in complex task scenarios. To address the issues of existing routing methods relying on manual rules, unified discriminant boundaries, or large-scale annotated data, as well as high maintenance costs during expert expansion, this paper proposes an expert routing method, BGMM-LSE, based on positive sample semantic distribution modeling. The method constructs a positive sample set using only the requests historically successfully processed by each candidate expert, and maps the requests into dense semantic vectors through a pre-trained text feature extraction model; subsequently, a Bayesian Gaussian mixture model (BGMM) is independently trained for each expert to characterize the capability distribution of its successful requests in the semantic space. During online inference, the system encodes the target request into a feature vector, calculates the log-likelihood score combining the retained Gaussian component parameters and the smoothed covariance matrix of each expert, and uses Log-Sum-Exp to aggregate the probability contributions of different components. Finally, the request is routed to the expert model(s) with the highest score. Experiments were evaluated based on seven tasks: Math, GSM-Symbolic, HumanEval, Mbpp, MMLU, AIME1983&amp;amp;ndash;2025, and HellaSwag. The results show that this method achieves an average routing accuracy of 86.25%. The experimental results demonstrate that BGMM-LSE can provide stable request distribution capabilities for multi-expert large language model systems while maintaining interpretability and scalability.</description>
	<pubDate>2026-07-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 736: An Expert Routing Method Based on Positive Sample Semantic Distribution via BGMM-LSE</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/736">doi: 10.3390/info17080736</a></p>
	<p>Authors:
		Weifeng Ren
		Ting Zheng
		Jie Zhang
		Yunzhong Chen
		Erkang Wei
		Chenxiao Liu
		Borui Fan
		Zhaiyuan Ji
		Yao Lu
		Jian He
		Yaxin Gao
		Shanqing Yu
		</p>
	<p>Multi-expert large language model systems need to dynamically distribute user requests among multiple candidate experts to improve inference accuracy and system efficiency in complex task scenarios. To address the issues of existing routing methods relying on manual rules, unified discriminant boundaries, or large-scale annotated data, as well as high maintenance costs during expert expansion, this paper proposes an expert routing method, BGMM-LSE, based on positive sample semantic distribution modeling. The method constructs a positive sample set using only the requests historically successfully processed by each candidate expert, and maps the requests into dense semantic vectors through a pre-trained text feature extraction model; subsequently, a Bayesian Gaussian mixture model (BGMM) is independently trained for each expert to characterize the capability distribution of its successful requests in the semantic space. During online inference, the system encodes the target request into a feature vector, calculates the log-likelihood score combining the retained Gaussian component parameters and the smoothed covariance matrix of each expert, and uses Log-Sum-Exp to aggregate the probability contributions of different components. Finally, the request is routed to the expert model(s) with the highest score. Experiments were evaluated based on seven tasks: Math, GSM-Symbolic, HumanEval, Mbpp, MMLU, AIME1983&amp;amp;ndash;2025, and HellaSwag. The results show that this method achieves an average routing accuracy of 86.25%. The experimental results demonstrate that BGMM-LSE can provide stable request distribution capabilities for multi-expert large language model systems while maintaining interpretability and scalability.</p>
	]]></content:encoded>

	<dc:title>An Expert Routing Method Based on Positive Sample Semantic Distribution via BGMM-LSE</dc:title>
			<dc:creator>Weifeng Ren</dc:creator>
			<dc:creator>Ting Zheng</dc:creator>
			<dc:creator>Jie Zhang</dc:creator>
			<dc:creator>Yunzhong Chen</dc:creator>
			<dc:creator>Erkang Wei</dc:creator>
			<dc:creator>Chenxiao Liu</dc:creator>
			<dc:creator>Borui Fan</dc:creator>
			<dc:creator>Zhaiyuan Ji</dc:creator>
			<dc:creator>Yao Lu</dc:creator>
			<dc:creator>Jian He</dc:creator>
			<dc:creator>Yaxin Gao</dc:creator>
			<dc:creator>Shanqing Yu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080736</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>736</prism:startingPage>
		<prism:doi>10.3390/info17080736</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/736</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/735">

	<title>Information, Vol. 17, Pages 735: Dual-Graph Convolutional Network with Context Fusion for Chinese Sentiment Classification</title>
	<link>https://www.mdpi.com/2078-2489/17/8/735</link>
	<description>Existing research on sentiment classification primarily focuses on textual contextual semantics while neglecting word co-occurrence and syntactic structure information. It also emphasizes semantic analysis of sequential structures but overlooks non-linear structural semantics. To address these limitations, we propose the DGCNCF (Dual-Graph Convolutional Network with Context Fusion) model for sentiment classification. The model employs a BiLSTM with an attention mechanism to extract textual contextual information. Subsequently, a text co-occurrence graph and a syntactic dependency graph are constructed separately. Meanwhile, contextual information is fused with node information within these graphs to obtain graph embedding representations of the text. Then, the model performs representation learning on the two graphs using GCN, thereby capturing the global word co-occurrence features and global syntactic dependency structure characteristics of the text. By integrating textual contextual information, word co-occurrence information, and syntactic dependency structure information, the model captures text features from semantic, lexical, and syntactic perspectives, thereby mitigating the limitations of relying on single-dimensional features. The validity of the model is verified on two public datasets, and the experimental results demonstrate that the model achieves effective sentiment classification performance.</description>
	<pubDate>2026-07-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 735: Dual-Graph Convolutional Network with Context Fusion for Chinese Sentiment Classification</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/735">doi: 10.3390/info17080735</a></p>
	<p>Authors:
		Lei Bai
		Zhenguo Chen
		</p>
	<p>Existing research on sentiment classification primarily focuses on textual contextual semantics while neglecting word co-occurrence and syntactic structure information. It also emphasizes semantic analysis of sequential structures but overlooks non-linear structural semantics. To address these limitations, we propose the DGCNCF (Dual-Graph Convolutional Network with Context Fusion) model for sentiment classification. The model employs a BiLSTM with an attention mechanism to extract textual contextual information. Subsequently, a text co-occurrence graph and a syntactic dependency graph are constructed separately. Meanwhile, contextual information is fused with node information within these graphs to obtain graph embedding representations of the text. Then, the model performs representation learning on the two graphs using GCN, thereby capturing the global word co-occurrence features and global syntactic dependency structure characteristics of the text. By integrating textual contextual information, word co-occurrence information, and syntactic dependency structure information, the model captures text features from semantic, lexical, and syntactic perspectives, thereby mitigating the limitations of relying on single-dimensional features. The validity of the model is verified on two public datasets, and the experimental results demonstrate that the model achieves effective sentiment classification performance.</p>
	]]></content:encoded>

	<dc:title>Dual-Graph Convolutional Network with Context Fusion for Chinese Sentiment Classification</dc:title>
			<dc:creator>Lei Bai</dc:creator>
			<dc:creator>Zhenguo Chen</dc:creator>
		<dc:identifier>doi: 10.3390/info17080735</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>735</prism:startingPage>
		<prism:doi>10.3390/info17080735</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/735</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/734">

	<title>Information, Vol. 17, Pages 734: Keyword-Based Medical Cloud Storage Integrity Auditing with Privacy Protection and Data Dynamics</title>
	<link>https://www.mdpi.com/2078-2489/17/8/734</link>
	<description>Keyword-based remote integrity auditing schemes effectively address the integrity of electronic medical records (EMRs) stored in the cloud. In practice, users expect to be able to perform flexible dynamic data updates while also protecting data privacy against a third-party auditor during the auditing process. However, existing schemes fail to simultaneously satisfy both requirements: they either incur prohibitive overhead for block-level updates or disclose to the auditor which EMRs match the target keyword and the number of such EMRs. To address this, we propose a new keyword-based auditing scheme for medical cloud. Specifically, we design a novel authentication identifier set. Unlike the keyword tags in Shen et al.&amp;amp;rsquo;s scheme, this set aggregates the block hashes and thereby enables the auditor to verify integrity without obtaining sensitive information. Furthermore, we introduce a dynamic hash list. By updating this list during block insertion and deletion, the scheme eliminates the need to recompute the authenticators of subsequent blocks, significantly enhancing the efficiency of dynamic data updates. Security analysis confirms that the proposed scheme is secure. Performance analysis shows our scheme reduces block insertion and deletion overhead by over 60% compared to Gao et al.&amp;amp;rsquo;s scheme, demonstrating high efficiency and practicality.</description>
	<pubDate>2026-07-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 734: Keyword-Based Medical Cloud Storage Integrity Auditing with Privacy Protection and Data Dynamics</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/734">doi: 10.3390/info17080734</a></p>
	<p>Authors:
		Meijuan Huang
		Siyu Chen
		Bo Yang
		Xiaoyan Zhao
		</p>
	<p>Keyword-based remote integrity auditing schemes effectively address the integrity of electronic medical records (EMRs) stored in the cloud. In practice, users expect to be able to perform flexible dynamic data updates while also protecting data privacy against a third-party auditor during the auditing process. However, existing schemes fail to simultaneously satisfy both requirements: they either incur prohibitive overhead for block-level updates or disclose to the auditor which EMRs match the target keyword and the number of such EMRs. To address this, we propose a new keyword-based auditing scheme for medical cloud. Specifically, we design a novel authentication identifier set. Unlike the keyword tags in Shen et al.&amp;amp;rsquo;s scheme, this set aggregates the block hashes and thereby enables the auditor to verify integrity without obtaining sensitive information. Furthermore, we introduce a dynamic hash list. By updating this list during block insertion and deletion, the scheme eliminates the need to recompute the authenticators of subsequent blocks, significantly enhancing the efficiency of dynamic data updates. Security analysis confirms that the proposed scheme is secure. Performance analysis shows our scheme reduces block insertion and deletion overhead by over 60% compared to Gao et al.&amp;amp;rsquo;s scheme, demonstrating high efficiency and practicality.</p>
	]]></content:encoded>

	<dc:title>Keyword-Based Medical Cloud Storage Integrity Auditing with Privacy Protection and Data Dynamics</dc:title>
			<dc:creator>Meijuan Huang</dc:creator>
			<dc:creator>Siyu Chen</dc:creator>
			<dc:creator>Bo Yang</dc:creator>
			<dc:creator>Xiaoyan Zhao</dc:creator>
		<dc:identifier>doi: 10.3390/info17080734</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>734</prism:startingPage>
		<prism:doi>10.3390/info17080734</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/734</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/733">

	<title>Information, Vol. 17, Pages 733: SRE-IDF: A Square Root Exponential Inverse Document Frequency Weighting Scheme for Automated Short Answer Grading</title>
	<link>https://www.mdpi.com/2078-2489/17/8/733</link>
	<description>Grading short answers on a large scale is a significant challenge for academic institutions and online learning platforms. This study proposes a Square Root Exponential Inverse Document Frequency (SRE-IDF) weighting scheme to address this challenge. The proposed SRE-IDF scheme reshapes the decay curve of the traditional IDF. It suppresses common filler terms while preserving the discriminative importance of concept-bearing vocabulary for Automated Short Answer Grading (ASAG). The SRE-IDF is a parameter-free weighting scheme. It produces bounded term weights in the interval between e&amp;amp;minus;1 and one. The proposed SRE-IDF was evaluated using three benchmark datasets: SciEntsBank, Mohler, and ASAG2024. The experimental results show that SRE-IDF consistently outperformed Traditional IDF, Smoothed IDF, and Best Matching 25 (BM25) across all three datasets. A comparison with a frozen Sentence Bidirectional Encoder Representations from Transformers (SBERT) baseline shows that SRE-IDF achieves competitive predictive performance while requiring substantially lower computational cost and offering greater interpretability. The analysis of statistical significance also reaffirmed the significance of the performance gains attained by the SRE-IDF. These findings support the claim that SRE-IDF is a robust and effective term-weighting strategy for similarity-based Automated Short Answer Grading (ASAG) in settings with heterogeneous and fine-grained evaluations.</description>
	<pubDate>2026-07-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 733: SRE-IDF: A Square Root Exponential Inverse Document Frequency Weighting Scheme for Automated Short Answer Grading</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/733">doi: 10.3390/info17080733</a></p>
	<p>Authors:
		Shahil Raj
		Arun Pandian J
		</p>
	<p>Grading short answers on a large scale is a significant challenge for academic institutions and online learning platforms. This study proposes a Square Root Exponential Inverse Document Frequency (SRE-IDF) weighting scheme to address this challenge. The proposed SRE-IDF scheme reshapes the decay curve of the traditional IDF. It suppresses common filler terms while preserving the discriminative importance of concept-bearing vocabulary for Automated Short Answer Grading (ASAG). The SRE-IDF is a parameter-free weighting scheme. It produces bounded term weights in the interval between e&amp;amp;minus;1 and one. The proposed SRE-IDF was evaluated using three benchmark datasets: SciEntsBank, Mohler, and ASAG2024. The experimental results show that SRE-IDF consistently outperformed Traditional IDF, Smoothed IDF, and Best Matching 25 (BM25) across all three datasets. A comparison with a frozen Sentence Bidirectional Encoder Representations from Transformers (SBERT) baseline shows that SRE-IDF achieves competitive predictive performance while requiring substantially lower computational cost and offering greater interpretability. The analysis of statistical significance also reaffirmed the significance of the performance gains attained by the SRE-IDF. These findings support the claim that SRE-IDF is a robust and effective term-weighting strategy for similarity-based Automated Short Answer Grading (ASAG) in settings with heterogeneous and fine-grained evaluations.</p>
	]]></content:encoded>

	<dc:title>SRE-IDF: A Square Root Exponential Inverse Document Frequency Weighting Scheme for Automated Short Answer Grading</dc:title>
			<dc:creator>Shahil Raj</dc:creator>
			<dc:creator>Arun Pandian J</dc:creator>
		<dc:identifier>doi: 10.3390/info17080733</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>733</prism:startingPage>
		<prism:doi>10.3390/info17080733</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/733</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/732">

	<title>Information, Vol. 17, Pages 732: Digital Twins for Real-Time Decision-Making in Supply Chain Management and Logistics: A Systematic Review</title>
	<link>https://www.mdpi.com/2078-2489/17/8/732</link>
	<description>Digital Twins are increasingly viewed as key enablers of real-time decision-making in supply chain management and logistics, yet the literature remains fragmented across application domains, decision problems, methodological approaches, and technological implementations. This systematic review examines how Digital Twins support real-time decision-making, understood not as a fixed response time threshold but as the temporal alignment between data refresh, decision generation, and system evolution. Following the PRISMA 2020 framework, a Scopus search conducted on 16 March 2026 identified studies in which Digital Twins were a central component, incorporated dynamically updated data, supported real-time or near-real-time decision-making, and addressed supply chain management or logistics problems. A total of 57 peer-reviewed studies were retained and synthesized using descriptive analysis, cross-tabulation, and thematic coding across decision problems, application contexts, solution methods, enabling technologies, implementation challenges, and future research directions. The findings show that real-time Digital Twin applications are concentrated mainly in production scheduling and planning, followed by routing and dispatching, resource allocation, disruption management, and inventory management. Methodologically, most studies adopt hybrid approaches combining simulation, optimization, and/or machine learning, reflecting the complexity of real-time operational decision-making. Enabling technologies were grouped into six functional layers, with data acquisition technologies receiving the greatest attention, while higher-level integration and enterprise system layers remain less developed. Reported challenges cluster around data, methodological, and systemic issues. The review concludes that real-time Digital Twins are emerging as integrated decision environments, but further research is needed on computational efficiency, interoperability, validation, and application in underexplored logistics domains.</description>
	<pubDate>2026-07-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 732: Digital Twins for Real-Time Decision-Making in Supply Chain Management and Logistics: A Systematic Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/732">doi: 10.3390/info17080732</a></p>
	<p>Authors:
		Anna Tolia
		Stavros T. Ponis
		</p>
	<p>Digital Twins are increasingly viewed as key enablers of real-time decision-making in supply chain management and logistics, yet the literature remains fragmented across application domains, decision problems, methodological approaches, and technological implementations. This systematic review examines how Digital Twins support real-time decision-making, understood not as a fixed response time threshold but as the temporal alignment between data refresh, decision generation, and system evolution. Following the PRISMA 2020 framework, a Scopus search conducted on 16 March 2026 identified studies in which Digital Twins were a central component, incorporated dynamically updated data, supported real-time or near-real-time decision-making, and addressed supply chain management or logistics problems. A total of 57 peer-reviewed studies were retained and synthesized using descriptive analysis, cross-tabulation, and thematic coding across decision problems, application contexts, solution methods, enabling technologies, implementation challenges, and future research directions. The findings show that real-time Digital Twin applications are concentrated mainly in production scheduling and planning, followed by routing and dispatching, resource allocation, disruption management, and inventory management. Methodologically, most studies adopt hybrid approaches combining simulation, optimization, and/or machine learning, reflecting the complexity of real-time operational decision-making. Enabling technologies were grouped into six functional layers, with data acquisition technologies receiving the greatest attention, while higher-level integration and enterprise system layers remain less developed. Reported challenges cluster around data, methodological, and systemic issues. The review concludes that real-time Digital Twins are emerging as integrated decision environments, but further research is needed on computational efficiency, interoperability, validation, and application in underexplored logistics domains.</p>
	]]></content:encoded>

	<dc:title>Digital Twins for Real-Time Decision-Making in Supply Chain Management and Logistics: A Systematic Review</dc:title>
			<dc:creator>Anna Tolia</dc:creator>
			<dc:creator>Stavros T. Ponis</dc:creator>
		<dc:identifier>doi: 10.3390/info17080732</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Systematic Review</prism:section>
	<prism:startingPage>732</prism:startingPage>
		<prism:doi>10.3390/info17080732</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/732</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/731">

	<title>Information, Vol. 17, Pages 731: A Fruit Gripping Evaluation System Based on Tactile Fusion Analysis</title>
	<link>https://www.mdpi.com/2078-2489/17/8/731</link>
	<description>To address the evaluation requirements for agricultural robotic harvesting, this work presented a fruit-grasping assessment system based on tactile fusion analysis. Four piezoresistive pressure sensors were symmetrically integrated into the inner surfaces of a flexible gripper. A signal-conditioning circuit and a data acquisition module transmitted tactile signals to a Transformer&amp;amp;ndash;Mamba fusion network for feature extraction and target classification. After being trained on a dataset comprising 300 samples, the model extracted deep tactile features to distinguish among three target categories: citrus fruits, branches, and leaves. Classification outputs generated control commands for a robotic manipulator, enabling obstacle-avoidance retraction and precise harvesting operations. Experimental evaluations, conducted in both indoor and outdoor environments, demonstrated a target recognition accuracy of 93.12%. The manipulator response time was below 0.5 s, and the operational success rate was 90%. The proposed sensing system and algorithmic framework showed strong adaptability and supported quantitative assessment of grasping performance. The fruit detachment, compression damage, and plant-collision risks were effectively reduced while operational stability and harvesting efficiency improved.</description>
	<pubDate>2026-07-29</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 731: A Fruit Gripping Evaluation System Based on Tactile Fusion Analysis</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/731">doi: 10.3390/info17080731</a></p>
	<p>Authors:
		Zhengda Chen
		Qizhi Wang
		Haoyang Li
		Jie Zhang
		Ben Hu
		Jie Liu
		</p>
	<p>To address the evaluation requirements for agricultural robotic harvesting, this work presented a fruit-grasping assessment system based on tactile fusion analysis. Four piezoresistive pressure sensors were symmetrically integrated into the inner surfaces of a flexible gripper. A signal-conditioning circuit and a data acquisition module transmitted tactile signals to a Transformer&amp;amp;ndash;Mamba fusion network for feature extraction and target classification. After being trained on a dataset comprising 300 samples, the model extracted deep tactile features to distinguish among three target categories: citrus fruits, branches, and leaves. Classification outputs generated control commands for a robotic manipulator, enabling obstacle-avoidance retraction and precise harvesting operations. Experimental evaluations, conducted in both indoor and outdoor environments, demonstrated a target recognition accuracy of 93.12%. The manipulator response time was below 0.5 s, and the operational success rate was 90%. The proposed sensing system and algorithmic framework showed strong adaptability and supported quantitative assessment of grasping performance. The fruit detachment, compression damage, and plant-collision risks were effectively reduced while operational stability and harvesting efficiency improved.</p>
	]]></content:encoded>

	<dc:title>A Fruit Gripping Evaluation System Based on Tactile Fusion Analysis</dc:title>
			<dc:creator>Zhengda Chen</dc:creator>
			<dc:creator>Qizhi Wang</dc:creator>
			<dc:creator>Haoyang Li</dc:creator>
			<dc:creator>Jie Zhang</dc:creator>
			<dc:creator>Ben Hu</dc:creator>
			<dc:creator>Jie Liu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080731</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-29</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-29</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>731</prism:startingPage>
		<prism:doi>10.3390/info17080731</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/731</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/730">

	<title>Information, Vol. 17, Pages 730: Graph Neural Networks for Software Vulnerability Mining: A Review</title>
	<link>https://www.mdpi.com/2078-2489/17/8/730</link>
	<description>Software vulnerability mining is important for improving software reliability and security. Compared with sequence-based models, graph neural networks (GNNs) can explicitly model program structures such as syntax, control flow, data flow, call relations, and dependency paths, and have therefore been widely studied for vulnerability detection, localization, explanation, and repair. This paper presents a PRISMA-informed structured topical review of 87 studies and addresses five research questions concerning program graph representation, homogeneous and heterogeneous GNN architectures, Graph&amp;amp;ndash;LLM integration, evaluation reliability, and future research directions. The reviewed evidence shows that graph-based methods are most effective when vulnerability mechanisms can be faithfully represented through explicit structural relations. However, their reported performance remains strongly affected by duplicated samples, random function-level splits, noisy labels, incomplete repository context, graph-construction errors, and weak explanation protocols. Homogeneous GNNs provide efficient structural message passing but may mix different semantic relations, whereas heterogeneous GNNs preserve relation types more explicitly at the cost of greater graph-quality and computational requirements. Graph&amp;amp;ndash;LLM systems can improve semantic reasoning, repository-level analysis, explanation generation, and repair support, but their benefits should be evaluated together with memory consumption, inference latency, deployment complexity, and verification cost. This review further proposes minimum requirements for reliable vulnerability benchmarks and verifiable explanations, and develops a strategic agenda covering leakage-resistant datasets, uncertainty-aware graph construction, repository-level evaluation, cost-effective Graph&amp;amp;ndash;LLM collaboration, and graph-guided autonomous vulnerability repair.</description>
	<pubDate>2026-07-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 730: Graph Neural Networks for Software Vulnerability Mining: A Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/730">doi: 10.3390/info17080730</a></p>
	<p>Authors:
		Yuan He
		Haikun Lv
		Xing Li
		Lulu Zeng
		Lina Zhang
		Dengqi Yang
		Xiaowei Li
		</p>
	<p>Software vulnerability mining is important for improving software reliability and security. Compared with sequence-based models, graph neural networks (GNNs) can explicitly model program structures such as syntax, control flow, data flow, call relations, and dependency paths, and have therefore been widely studied for vulnerability detection, localization, explanation, and repair. This paper presents a PRISMA-informed structured topical review of 87 studies and addresses five research questions concerning program graph representation, homogeneous and heterogeneous GNN architectures, Graph&amp;amp;ndash;LLM integration, evaluation reliability, and future research directions. The reviewed evidence shows that graph-based methods are most effective when vulnerability mechanisms can be faithfully represented through explicit structural relations. However, their reported performance remains strongly affected by duplicated samples, random function-level splits, noisy labels, incomplete repository context, graph-construction errors, and weak explanation protocols. Homogeneous GNNs provide efficient structural message passing but may mix different semantic relations, whereas heterogeneous GNNs preserve relation types more explicitly at the cost of greater graph-quality and computational requirements. Graph&amp;amp;ndash;LLM systems can improve semantic reasoning, repository-level analysis, explanation generation, and repair support, but their benefits should be evaluated together with memory consumption, inference latency, deployment complexity, and verification cost. This review further proposes minimum requirements for reliable vulnerability benchmarks and verifiable explanations, and develops a strategic agenda covering leakage-resistant datasets, uncertainty-aware graph construction, repository-level evaluation, cost-effective Graph&amp;amp;ndash;LLM collaboration, and graph-guided autonomous vulnerability repair.</p>
	]]></content:encoded>

	<dc:title>Graph Neural Networks for Software Vulnerability Mining: A Review</dc:title>
			<dc:creator>Yuan He</dc:creator>
			<dc:creator>Haikun Lv</dc:creator>
			<dc:creator>Xing Li</dc:creator>
			<dc:creator>Lulu Zeng</dc:creator>
			<dc:creator>Lina Zhang</dc:creator>
			<dc:creator>Dengqi Yang</dc:creator>
			<dc:creator>Xiaowei Li</dc:creator>
		<dc:identifier>doi: 10.3390/info17080730</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-28</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-28</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>730</prism:startingPage>
		<prism:doi>10.3390/info17080730</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/730</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/729">

	<title>Information, Vol. 17, Pages 729: Hybrid Invariant Latent Feature Graph Transformer for Skeleton-Based Human Action Recognition</title>
	<link>https://www.mdpi.com/2078-2489/17/8/729</link>
	<description>Skeleton-based human action recognition is an important problem in applied vision systems, yet many existing approaches depend on a single skeleton descriptor or a single feature-learning mechanism. This restriction can weaken the representation of local body kinematics, long-range joint relations, and temporal dependencies within an action sequence. To address these limitations, this paper proposes HILF-GT (Hybrid Invariant Latent Feature Graph Transformer), a hybrid Graph Convolutional Network (GCN)-Transformer framework based on multiple spatio-temporal invariant latent features. The representation module constructs complementary structured tensors from skeleton graphs, inter-joint distances, adjacent-frame joint displacements, and inter-limb angles. Instead of transforming these descriptors into image-like maps for separate Convolutional Neural Network (CNN)-based classification, HILF-GT keeps their graph and temporal organization during learning. A local GCN branch models skeleton-aware kinematic patterns, whereas a graph-aware Transformer branch uses biased self-attention and cross-attention to capture dependencies among distant joints, frames, and latent-feature streams. A Perceiver-style latent bottleneck is further introduced to reduce the memory cost of global attention over frame-joint tokens. Experiments were conducted on four standard benchmark datasets, including NTU-RGB+D 60, NTU-RGB+D 120, NW-UCLA, and UTD-MHAD. The proposed method achieved 93.1% and 97.20% accuracy on the NTU-RGB+D 60 Cross-Subject and Cross-View protocols, 88.15% and 90.20% on the NTU-RGB+D 120 Cross-Subject and Cross-Setup protocols, 98.50% on NW-UCLA, and 97.50% on UTD-MHAD.</description>
	<pubDate>2026-07-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 729: Hybrid Invariant Latent Feature Graph Transformer for Skeleton-Based Human Action Recognition</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/729">doi: 10.3390/info17080729</a></p>
	<p>Authors:
		Kabul Khudaybergenov
		Avazjon Marakhimov
		</p>
	<p>Skeleton-based human action recognition is an important problem in applied vision systems, yet many existing approaches depend on a single skeleton descriptor or a single feature-learning mechanism. This restriction can weaken the representation of local body kinematics, long-range joint relations, and temporal dependencies within an action sequence. To address these limitations, this paper proposes HILF-GT (Hybrid Invariant Latent Feature Graph Transformer), a hybrid Graph Convolutional Network (GCN)-Transformer framework based on multiple spatio-temporal invariant latent features. The representation module constructs complementary structured tensors from skeleton graphs, inter-joint distances, adjacent-frame joint displacements, and inter-limb angles. Instead of transforming these descriptors into image-like maps for separate Convolutional Neural Network (CNN)-based classification, HILF-GT keeps their graph and temporal organization during learning. A local GCN branch models skeleton-aware kinematic patterns, whereas a graph-aware Transformer branch uses biased self-attention and cross-attention to capture dependencies among distant joints, frames, and latent-feature streams. A Perceiver-style latent bottleneck is further introduced to reduce the memory cost of global attention over frame-joint tokens. Experiments were conducted on four standard benchmark datasets, including NTU-RGB+D 60, NTU-RGB+D 120, NW-UCLA, and UTD-MHAD. The proposed method achieved 93.1% and 97.20% accuracy on the NTU-RGB+D 60 Cross-Subject and Cross-View protocols, 88.15% and 90.20% on the NTU-RGB+D 120 Cross-Subject and Cross-Setup protocols, 98.50% on NW-UCLA, and 97.50% on UTD-MHAD.</p>
	]]></content:encoded>

	<dc:title>Hybrid Invariant Latent Feature Graph Transformer for Skeleton-Based Human Action Recognition</dc:title>
			<dc:creator>Kabul Khudaybergenov</dc:creator>
			<dc:creator>Avazjon Marakhimov</dc:creator>
		<dc:identifier>doi: 10.3390/info17080729</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-28</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-28</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>729</prism:startingPage>
		<prism:doi>10.3390/info17080729</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/729</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/728">

	<title>Information, Vol. 17, Pages 728: Attention Bidirectional Gated Fusion Based Multimodal Intent Recognition Under Uncertain Missing Modalities</title>
	<link>https://www.mdpi.com/2078-2489/17/8/728</link>
	<description>Currently, uncertain missing modalities pose new challenges to multimodal intent recognition. To tackle this issue, this work proposes an Attention Bidirectional Gated Fusion Based Multimodal Intent Recognition model under Uncertain Missing Modalities (named ABGFMIR). Firstly, ABGFMIR extracts the features of each modality (text, audio, visual) with the LSTM network, respectively. Secondly, ABGFMIR narrows the distances between audio, visual and text modality based on Central Moment Discrepancy (CMD), and then performs multimodal feature fusion through an attention bidirectional gated fusion method. Then, corresponding attention level prompts are generated based on the uncertain missing modalities situations of the current sample. The fused multimodal features are then input into the Transformer encoder and decoder, and the prompts are injected into the keys and values of the multihead self-attention layer to guide the Transformer to focus on the missing modes and dynamically adjust the attention distribution, enhancing the robustness of ABGFMIR to different missing modes. Finally, the features produced by the Transformer are fed into the classification layer for intent recognition. Simultaneously, the pre-trained model (AGNN) that trained with the complete modality is employed in the classification layer to guide the main module of ABGFMIR. Two public benchmark datasets (MIntRec and EMOTyDA) are adopted for performance verification. Compared with the other five baseline models, on the MIntRec dataset, ABGFMIR improved accuracy by an average of 2.68 and improved F1 values by an average of 3.24. On the EMOTyDA dataset, ABGFMIR improved accuracy by an average of 2.28 and improved F1 values by an average of 3.44.</description>
	<pubDate>2026-07-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 728: Attention Bidirectional Gated Fusion Based Multimodal Intent Recognition Under Uncertain Missing Modalities</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/728">doi: 10.3390/info17080728</a></p>
	<p>Authors:
		Ling Shang
		Zhizhong Liu
		Yuxuan Wu
		Xiaoyu Song
		Jian Yu
		Quan Z. Sheng
		</p>
	<p>Currently, uncertain missing modalities pose new challenges to multimodal intent recognition. To tackle this issue, this work proposes an Attention Bidirectional Gated Fusion Based Multimodal Intent Recognition model under Uncertain Missing Modalities (named ABGFMIR). Firstly, ABGFMIR extracts the features of each modality (text, audio, visual) with the LSTM network, respectively. Secondly, ABGFMIR narrows the distances between audio, visual and text modality based on Central Moment Discrepancy (CMD), and then performs multimodal feature fusion through an attention bidirectional gated fusion method. Then, corresponding attention level prompts are generated based on the uncertain missing modalities situations of the current sample. The fused multimodal features are then input into the Transformer encoder and decoder, and the prompts are injected into the keys and values of the multihead self-attention layer to guide the Transformer to focus on the missing modes and dynamically adjust the attention distribution, enhancing the robustness of ABGFMIR to different missing modes. Finally, the features produced by the Transformer are fed into the classification layer for intent recognition. Simultaneously, the pre-trained model (AGNN) that trained with the complete modality is employed in the classification layer to guide the main module of ABGFMIR. Two public benchmark datasets (MIntRec and EMOTyDA) are adopted for performance verification. Compared with the other five baseline models, on the MIntRec dataset, ABGFMIR improved accuracy by an average of 2.68 and improved F1 values by an average of 3.24. On the EMOTyDA dataset, ABGFMIR improved accuracy by an average of 2.28 and improved F1 values by an average of 3.44.</p>
	]]></content:encoded>

	<dc:title>Attention Bidirectional Gated Fusion Based Multimodal Intent Recognition Under Uncertain Missing Modalities</dc:title>
			<dc:creator>Ling Shang</dc:creator>
			<dc:creator>Zhizhong Liu</dc:creator>
			<dc:creator>Yuxuan Wu</dc:creator>
			<dc:creator>Xiaoyu Song</dc:creator>
			<dc:creator>Jian Yu</dc:creator>
			<dc:creator>Quan Z. Sheng</dc:creator>
		<dc:identifier>doi: 10.3390/info17080728</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-28</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-28</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>728</prism:startingPage>
		<prism:doi>10.3390/info17080728</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/728</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/727">

	<title>Information, Vol. 17, Pages 727: Profile-Free Behavioral Characterization of Bot-like Activity in a Political Reply Ecosystem on X: A Case Study</title>
	<link>https://www.mdpi.com/2078-2489/17/8/727</link>
	<description>Coordinated and bot-like activity on social media is usually studied with supervised detectors that need rich account data such as profiles, timelines, and follower networks, which is increasingly hard to obtain. We ask what can be established about a single account&amp;amp;rsquo;s reply ecosystem from its publicly visible posts and replies alone, with no profiles, timelines, or follower data. In a case study of the reply ecosystem of an official political party account (23,953 replies by 1985 accounts, December 2025 to January 2026), we compute profile-free behavioral features covering text duplication, character-level entropy, timing regularity, reply latency, and post coverage, complemented by a co-commenting network analysis, and group active accounts with unsupervised density-based clustering. The clustering, combined with two transparent labeling rules, separates three behavioral tiers: templated amplifiers defined by text reuse, persistent responders with human-like text but extreme volume and coverage, and an organic remainder. The two non-organic tiers comprise 5.4% of accounts, yet produce 53.5% of all comments, a composition that is stable under resampling and threshold sensitivity analysis, with a failure mode that is only conservative, since over-strict settings leave a tier unassigned rather than reshaping it. The platform&amp;amp;rsquo;s own spam flags, never used as input, rise steadily from organic accounts to templated amplifiers, consistent with the behavioral grouping.</description>
	<pubDate>2026-07-28</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 727: Profile-Free Behavioral Characterization of Bot-like Activity in a Political Reply Ecosystem on X: A Case Study</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/727">doi: 10.3390/info17080727</a></p>
	<p>Authors:
		Kalin Kopanov
		Tatiana Atanasova
		</p>
	<p>Coordinated and bot-like activity on social media is usually studied with supervised detectors that need rich account data such as profiles, timelines, and follower networks, which is increasingly hard to obtain. We ask what can be established about a single account&amp;amp;rsquo;s reply ecosystem from its publicly visible posts and replies alone, with no profiles, timelines, or follower data. In a case study of the reply ecosystem of an official political party account (23,953 replies by 1985 accounts, December 2025 to January 2026), we compute profile-free behavioral features covering text duplication, character-level entropy, timing regularity, reply latency, and post coverage, complemented by a co-commenting network analysis, and group active accounts with unsupervised density-based clustering. The clustering, combined with two transparent labeling rules, separates three behavioral tiers: templated amplifiers defined by text reuse, persistent responders with human-like text but extreme volume and coverage, and an organic remainder. The two non-organic tiers comprise 5.4% of accounts, yet produce 53.5% of all comments, a composition that is stable under resampling and threshold sensitivity analysis, with a failure mode that is only conservative, since over-strict settings leave a tier unassigned rather than reshaping it. The platform&amp;amp;rsquo;s own spam flags, never used as input, rise steadily from organic accounts to templated amplifiers, consistent with the behavioral grouping.</p>
	]]></content:encoded>

	<dc:title>Profile-Free Behavioral Characterization of Bot-like Activity in a Political Reply Ecosystem on X: A Case Study</dc:title>
			<dc:creator>Kalin Kopanov</dc:creator>
			<dc:creator>Tatiana Atanasova</dc:creator>
		<dc:identifier>doi: 10.3390/info17080727</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-28</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-28</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>727</prism:startingPage>
		<prism:doi>10.3390/info17080727</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/727</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/726">

	<title>Information, Vol. 17, Pages 726: MythoBiLLM: BiLSTM-Guided Parameter-Efficient Fine-Tuning of Large Language Models for Coherent Summarization and Generation of Indian Mythological Texts</title>
	<link>https://www.mdpi.com/2078-2489/17/8/726</link>
	<description>Indian mythological narratives contain long event chains, recurring characters, moral conflicts, interactions between human and divine agents, and source-specific narrative styles. General-purpose large language models can generate fluent text while losing character continuity, thematic relations, or source-supported events. This study presents MythoBiLLM, a parameter-efficient framework for summarization and continuation generation from Indian mythological texts. The framework combines a frozen Llama 3.2 3B-Instruct backbone, LoRA-based adaptation, and a gated BiLSTM narrative-memory adapter. A corpus of public-domain English translations from the Ramayana, Mahabharata, Bhagavad-Gita, Vishnupuranam, Harivamsha, Hindu Tales, and Indian Myth and Legend contains 3,684,838 word-level tokens and 6057 segmented passages. Evaluation covers language modeling, summarization, continuation generation, entity consistency, theme retention, component ablation, robustness, human assessment, and statistical testing. Relative to LLM+LoRA, the complete framework reduces average perplexity from 23.4 to 19.8. In controlled comparisons, the BiLSTM adapter achieves an MCS of 0.713 on both tasks, compared with 0.699 for the parameter-matched MLP adapter, 0.704 for independently trained long-context LoRA, and 0.708 for retrieval augmentation. Full MythoBiLLM reaches MCS values of 0.762 for summarization and 0.744 for continuation generation. After entity consistency and style alignment are excluded from MCS, the complete configuration retains the highest scores of 0.751 and 0.731. These findings support the complete framework on the evaluated corpus, while the controlled comparisons indicate a modest complementary contribution from the BiLSTM and do not identify it as the sole source of the performance gains.</description>
	<pubDate>2026-07-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 726: MythoBiLLM: BiLSTM-Guided Parameter-Efficient Fine-Tuning of Large Language Models for Coherent Summarization and Generation of Indian Mythological Texts</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/726">doi: 10.3390/info17080726</a></p>
	<p>Authors:
		Shweta Bansal
		Sumendra Yogarayan
		Siti Fatimah Abdul Razak
		</p>
	<p>Indian mythological narratives contain long event chains, recurring characters, moral conflicts, interactions between human and divine agents, and source-specific narrative styles. General-purpose large language models can generate fluent text while losing character continuity, thematic relations, or source-supported events. This study presents MythoBiLLM, a parameter-efficient framework for summarization and continuation generation from Indian mythological texts. The framework combines a frozen Llama 3.2 3B-Instruct backbone, LoRA-based adaptation, and a gated BiLSTM narrative-memory adapter. A corpus of public-domain English translations from the Ramayana, Mahabharata, Bhagavad-Gita, Vishnupuranam, Harivamsha, Hindu Tales, and Indian Myth and Legend contains 3,684,838 word-level tokens and 6057 segmented passages. Evaluation covers language modeling, summarization, continuation generation, entity consistency, theme retention, component ablation, robustness, human assessment, and statistical testing. Relative to LLM+LoRA, the complete framework reduces average perplexity from 23.4 to 19.8. In controlled comparisons, the BiLSTM adapter achieves an MCS of 0.713 on both tasks, compared with 0.699 for the parameter-matched MLP adapter, 0.704 for independently trained long-context LoRA, and 0.708 for retrieval augmentation. Full MythoBiLLM reaches MCS values of 0.762 for summarization and 0.744 for continuation generation. After entity consistency and style alignment are excluded from MCS, the complete configuration retains the highest scores of 0.751 and 0.731. These findings support the complete framework on the evaluated corpus, while the controlled comparisons indicate a modest complementary contribution from the BiLSTM and do not identify it as the sole source of the performance gains.</p>
	]]></content:encoded>

	<dc:title>MythoBiLLM: BiLSTM-Guided Parameter-Efficient Fine-Tuning of Large Language Models for Coherent Summarization and Generation of Indian Mythological Texts</dc:title>
			<dc:creator>Shweta Bansal</dc:creator>
			<dc:creator>Sumendra Yogarayan</dc:creator>
			<dc:creator>Siti Fatimah Abdul Razak</dc:creator>
		<dc:identifier>doi: 10.3390/info17080726</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-27</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-27</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>726</prism:startingPage>
		<prism:doi>10.3390/info17080726</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/726</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/725">

	<title>Information, Vol. 17, Pages 725: Structural Digital Twin-Driven Conformance Assessment of LegalTech Governance Ontology: Reproducible Proof of Concept</title>
	<link>https://www.mdpi.com/2078-2489/17/8/725</link>
	<description>The increasing convergence of enterprise architecture and IT governance frameworks, such as TOGAF 9.2, COBIT 5, and NIST CSF 1.1, with LegalTech regulations including GDPR 2016/679, eIDAS 910/2014, and NIS2 2022/2555, has created a growing need for rigorous and automated governance-validation mechanisms. However, to date, no formal approach exists to assess semantic conformance between a normative ontological model and its operational implementation in microservice-based systems, leaving critical governance gaps difficult to detect in legally sensitive environments. This paper proposes MALTG (Multidimensional Architecture for LegalTech Governance), a configurable and reusable formal framework that combines OWL 2 ontology engineering, a JSON-LD-based SDT (Structural Digital Twin), semantic conformance mapping, a hierarchical coverage function, and a conformance gap metric to support automated governance assessment and prioritised remediation. The framework accepts any organisational architecture as input, enabling application to arbitrary LegalTech case studies by replacing the reference SDT. The proposed framework models nine governance dimensions through an ontology of 59 classes and 15 properties and validates them against a semi-real, public-source SDT composed of 39 microservice components and 54 directed connections. The reference SDT was populated through an ontology-driven data-collectionprocess: a scraping campaign guided by the MALTG ontology (data/MALTG_Ontology.owl) harvested public information from the official portal of Ecuador&amp;amp;rsquo;s Council of the Judiciary (Consejo de la Judicatura, CJ)&amp;amp;mdash;probing its technological-maturity level and digital-governance compliance&amp;amp;mdash;which was condensed into a single JSON-LD artefact, enforcing domain rigour and traceability on the search for LegalTech governance evidence. Experimental results demonstrated an overall ontological score of 82.6 and an SDT score of 73.7, with a mean conformance gap of 8.9. Five dimensions achieved full conformance, while the LegalTech dimension presented the largest gap. Graph-theoretic validation further confirmed monotonic improvement throughout the remediation sequence. Overall, the findings suggest that MALTG provides a formally grounded and reproducible approach for automating multi-framework LegalTech governance conformance assessment while maintaining semantic and structural traceability between normative models and operational architectures. As a proof of concept, this validation relies on a configurable, ontology-driven public-source (semi-real) SDT; external validity in real production LegalTech organisations remains untested and is left for future work.</description>
	<pubDate>2026-07-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 725: Structural Digital Twin-Driven Conformance Assessment of LegalTech Governance Ontology: Reproducible Proof of Concept</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/725">doi: 10.3390/info17080725</a></p>
	<p>Authors:
		Patricio M. Paccha-Angamarca
		Erwin J. Sacoto-Cabrera
		Víctor V. Velepucha-Bonett
		</p>
	<p>The increasing convergence of enterprise architecture and IT governance frameworks, such as TOGAF 9.2, COBIT 5, and NIST CSF 1.1, with LegalTech regulations including GDPR 2016/679, eIDAS 910/2014, and NIS2 2022/2555, has created a growing need for rigorous and automated governance-validation mechanisms. However, to date, no formal approach exists to assess semantic conformance between a normative ontological model and its operational implementation in microservice-based systems, leaving critical governance gaps difficult to detect in legally sensitive environments. This paper proposes MALTG (Multidimensional Architecture for LegalTech Governance), a configurable and reusable formal framework that combines OWL 2 ontology engineering, a JSON-LD-based SDT (Structural Digital Twin), semantic conformance mapping, a hierarchical coverage function, and a conformance gap metric to support automated governance assessment and prioritised remediation. The framework accepts any organisational architecture as input, enabling application to arbitrary LegalTech case studies by replacing the reference SDT. The proposed framework models nine governance dimensions through an ontology of 59 classes and 15 properties and validates them against a semi-real, public-source SDT composed of 39 microservice components and 54 directed connections. The reference SDT was populated through an ontology-driven data-collectionprocess: a scraping campaign guided by the MALTG ontology (data/MALTG_Ontology.owl) harvested public information from the official portal of Ecuador&amp;amp;rsquo;s Council of the Judiciary (Consejo de la Judicatura, CJ)&amp;amp;mdash;probing its technological-maturity level and digital-governance compliance&amp;amp;mdash;which was condensed into a single JSON-LD artefact, enforcing domain rigour and traceability on the search for LegalTech governance evidence. Experimental results demonstrated an overall ontological score of 82.6 and an SDT score of 73.7, with a mean conformance gap of 8.9. Five dimensions achieved full conformance, while the LegalTech dimension presented the largest gap. Graph-theoretic validation further confirmed monotonic improvement throughout the remediation sequence. Overall, the findings suggest that MALTG provides a formally grounded and reproducible approach for automating multi-framework LegalTech governance conformance assessment while maintaining semantic and structural traceability between normative models and operational architectures. As a proof of concept, this validation relies on a configurable, ontology-driven public-source (semi-real) SDT; external validity in real production LegalTech organisations remains untested and is left for future work.</p>
	]]></content:encoded>

	<dc:title>Structural Digital Twin-Driven Conformance Assessment of LegalTech Governance Ontology: Reproducible Proof of Concept</dc:title>
			<dc:creator>Patricio M. Paccha-Angamarca</dc:creator>
			<dc:creator>Erwin J. Sacoto-Cabrera</dc:creator>
			<dc:creator>Víctor V. Velepucha-Bonett</dc:creator>
		<dc:identifier>doi: 10.3390/info17080725</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-27</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-27</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>725</prism:startingPage>
		<prism:doi>10.3390/info17080725</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/725</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/724">

	<title>Information, Vol. 17, Pages 724: LCA-Net: A Lightweight Network for Small Object Detection in Road Traffic Scenes</title>
	<link>https://www.mdpi.com/2078-2489/17/8/724</link>
	<description>Detecting small and distant objects in road traffic scenarios remains challenging owing to limited pixel resolution, cluttered backgrounds, and resource constraints on edge computing platforms. This work presents LCA-Net, a computationally efficient framework for small object detection that balances accuracy with model complexity. The framework incorporates three complementary designs: an Adaptive Deformable Downsampling Module (ADDM) that merges asymmetric and deformable convolution operations to improve spatial feature encoding while explicitly accounting for the parameter and computational cost of offset and modulation-mask prediction; a Cross-Scale Feature Fusion Pyramid (CSFFP) specifically engineered for minute objects, which augments multi-scale feature learning and enhances detection of far-field small targets; and a Lightweight Feature-Gated Detection Head (LFGDH) that employs channel&amp;amp;ndash;spatial attention to selectively emphasize informative features, thereby reducing both parameter count and computational cost. On Udacity, LCA-Net improves mAP@0.5 by 2.3 percentage points; on VisDrone2019, it improves mAP@0.5 by 1.7 percentage points. Across both benchmarks, the complete model reduces the parameter count by 25.58% and GFLOPs by 16.05% relative to YOLOv8-N. On the RTX A6000, LCA-Net-N reduces forward-pass latency from 1.82 to 1.63 ms, increases throughput from 549 to 613 FPS, and lowers peak GPU memory from 1180 to 1015 MiB. These results demonstrate a favorable accuracy&amp;amp;ndash;efficiency trade-off for real-time traffic perception.</description>
	<pubDate>2026-07-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 724: LCA-Net: A Lightweight Network for Small Object Detection in Road Traffic Scenes</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/724">doi: 10.3390/info17080724</a></p>
	<p>Authors:
		Shan Lin
		Bensheng Yun
		Zhenyu Lin
		Jie Shen
		Qinghua Xu
		</p>
	<p>Detecting small and distant objects in road traffic scenarios remains challenging owing to limited pixel resolution, cluttered backgrounds, and resource constraints on edge computing platforms. This work presents LCA-Net, a computationally efficient framework for small object detection that balances accuracy with model complexity. The framework incorporates three complementary designs: an Adaptive Deformable Downsampling Module (ADDM) that merges asymmetric and deformable convolution operations to improve spatial feature encoding while explicitly accounting for the parameter and computational cost of offset and modulation-mask prediction; a Cross-Scale Feature Fusion Pyramid (CSFFP) specifically engineered for minute objects, which augments multi-scale feature learning and enhances detection of far-field small targets; and a Lightweight Feature-Gated Detection Head (LFGDH) that employs channel&amp;amp;ndash;spatial attention to selectively emphasize informative features, thereby reducing both parameter count and computational cost. On Udacity, LCA-Net improves mAP@0.5 by 2.3 percentage points; on VisDrone2019, it improves mAP@0.5 by 1.7 percentage points. Across both benchmarks, the complete model reduces the parameter count by 25.58% and GFLOPs by 16.05% relative to YOLOv8-N. On the RTX A6000, LCA-Net-N reduces forward-pass latency from 1.82 to 1.63 ms, increases throughput from 549 to 613 FPS, and lowers peak GPU memory from 1180 to 1015 MiB. These results demonstrate a favorable accuracy&amp;amp;ndash;efficiency trade-off for real-time traffic perception.</p>
	]]></content:encoded>

	<dc:title>LCA-Net: A Lightweight Network for Small Object Detection in Road Traffic Scenes</dc:title>
			<dc:creator>Shan Lin</dc:creator>
			<dc:creator>Bensheng Yun</dc:creator>
			<dc:creator>Zhenyu Lin</dc:creator>
			<dc:creator>Jie Shen</dc:creator>
			<dc:creator>Qinghua Xu</dc:creator>
		<dc:identifier>doi: 10.3390/info17080724</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-27</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-27</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>724</prism:startingPage>
		<prism:doi>10.3390/info17080724</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/724</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/723">

	<title>Information, Vol. 17, Pages 723: Leveraging Transformer Embeddings for Real-Time Discovery of Malicious URL Campaigns in the Generative-AI Threat Era</title>
	<link>https://www.mdpi.com/2078-2489/17/8/723</link>
	<description>The proliferation of algorithmically generated malicious URLs presents a critical challenge for modern cybersecurity, requiring a shift from syntactic pattern-matching toward semantic understanding grounded in pre-trained transformer foundations. Building on our prior work on billion-scale semantic search and density-based campaign clustering, this paper presents a unified, deployable framework for real-time campaign discovery. The framework converts raw URL streams into dense Sentence-BERT embeddings and couples approximate nearest neighbor search with online density-based clustering, discovering emerging campaigns without prior knowledge of their number or shape. Our central finding is that the choice of semantic representation is decisive: a domain-focused embedding strategy yields near-perfect campaign separation, substantially outperforming full-URL representations. On live, in-the-wild threat feeds, the domain-focused representation recovers all 944 discovered campaigns at an Adjusted Rand Index of 0.990 and a mean campaign recall of 1.000, at 0.10 ms per URL. Under identical clustering, the full-URL representation reaches an Adjusted Rand Index of only 0.510 and recovers fewer than half of the campaigns. We add a SHAP-based explainability layer that attributes discovery decisions to interpretable structural patterns, and we expose the whole pipeline as an operational system with a REST interface for single- and batch-URL analysis. The encoder we employ is a discriminative representation model rather than a generative one; what we contribute is the representation-and-modeling discipline this setting demands, and the resulting guidance transfers to threat intelligence in an era of generatively produced attack campaigns.</description>
	<pubDate>2026-07-27</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 723: Leveraging Transformer Embeddings for Real-Time Discovery of Malicious URL Campaigns in the Generative-AI Threat Era</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/723">doi: 10.3390/info17080723</a></p>
	<p>Authors:
		Georgios Feretzakis
		Dimitrios Karapiperis
		Sarandis Mitropoulos
		</p>
	<p>The proliferation of algorithmically generated malicious URLs presents a critical challenge for modern cybersecurity, requiring a shift from syntactic pattern-matching toward semantic understanding grounded in pre-trained transformer foundations. Building on our prior work on billion-scale semantic search and density-based campaign clustering, this paper presents a unified, deployable framework for real-time campaign discovery. The framework converts raw URL streams into dense Sentence-BERT embeddings and couples approximate nearest neighbor search with online density-based clustering, discovering emerging campaigns without prior knowledge of their number or shape. Our central finding is that the choice of semantic representation is decisive: a domain-focused embedding strategy yields near-perfect campaign separation, substantially outperforming full-URL representations. On live, in-the-wild threat feeds, the domain-focused representation recovers all 944 discovered campaigns at an Adjusted Rand Index of 0.990 and a mean campaign recall of 1.000, at 0.10 ms per URL. Under identical clustering, the full-URL representation reaches an Adjusted Rand Index of only 0.510 and recovers fewer than half of the campaigns. We add a SHAP-based explainability layer that attributes discovery decisions to interpretable structural patterns, and we expose the whole pipeline as an operational system with a REST interface for single- and batch-URL analysis. The encoder we employ is a discriminative representation model rather than a generative one; what we contribute is the representation-and-modeling discipline this setting demands, and the resulting guidance transfers to threat intelligence in an era of generatively produced attack campaigns.</p>
	]]></content:encoded>

	<dc:title>Leveraging Transformer Embeddings for Real-Time Discovery of Malicious URL Campaigns in the Generative-AI Threat Era</dc:title>
			<dc:creator>Georgios Feretzakis</dc:creator>
			<dc:creator>Dimitrios Karapiperis</dc:creator>
			<dc:creator>Sarandis Mitropoulos</dc:creator>
		<dc:identifier>doi: 10.3390/info17080723</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-27</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-27</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>723</prism:startingPage>
		<prism:doi>10.3390/info17080723</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/723</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/722">

	<title>Information, Vol. 17, Pages 722: Reframing Historical Text Extraction: A Cross-Pathway Validation of OCR, LLM-Assisted Correction, and Direct Multimodal Transcription</title>
	<link>https://www.mdpi.com/2078-2489/17/8/722</link>
	<description>Historical document collections are increasingly available as digitised images and PDFs, but their conversion into reliable text remains affected by optical character recognition (OCR) errors, degraded pages, heterogeneous layouts, and domain-specific terminology. This study proposes a pathway-level framework for documenting and comparing conventional OCR, OCR followed by large language model (LLM)-assisted correction, and direct multimodal transcription. The framework is demonstrated using the Portuguese Agricultural and Forestry Surveys (1950&amp;amp;ndash;1958). A stratified validation sample of 45 pages was selected by visual quality, page type, and geographic coverage. Outputs were evaluated against manually verified reference transcriptions using content-normalised character error rate (CER) and word error rate (WER), document-condition analysis, paired statistical tests, and an entity-level semantic preservation assessment focused on place names, agricultural terms, and measurement expressions. Under the evaluated model and interface conditions, both LLM-based pathways produced lower mean CER and WER than the conventional OCR baseline, with the lowest values observed for direct multimodal transcription. Semantic preservation was also higher for the LLM-based pathways, although measurement expressions remained the most persistent risk, particularly in table-based pages. Downstream tasks were not directly evaluated. The findings support the framework as a method for validating text-extraction pathways before reuse, rather than establishing a universal ranking of tools.</description>
	<pubDate>2026-07-25</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 722: Reframing Historical Text Extraction: A Cross-Pathway Validation of OCR, LLM-Assisted Correction, and Direct Multimodal Transcription</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/722">doi: 10.3390/info17080722</a></p>
	<p>Authors:
		Cláudia M. Viana
		</p>
	<p>Historical document collections are increasingly available as digitised images and PDFs, but their conversion into reliable text remains affected by optical character recognition (OCR) errors, degraded pages, heterogeneous layouts, and domain-specific terminology. This study proposes a pathway-level framework for documenting and comparing conventional OCR, OCR followed by large language model (LLM)-assisted correction, and direct multimodal transcription. The framework is demonstrated using the Portuguese Agricultural and Forestry Surveys (1950&amp;amp;ndash;1958). A stratified validation sample of 45 pages was selected by visual quality, page type, and geographic coverage. Outputs were evaluated against manually verified reference transcriptions using content-normalised character error rate (CER) and word error rate (WER), document-condition analysis, paired statistical tests, and an entity-level semantic preservation assessment focused on place names, agricultural terms, and measurement expressions. Under the evaluated model and interface conditions, both LLM-based pathways produced lower mean CER and WER than the conventional OCR baseline, with the lowest values observed for direct multimodal transcription. Semantic preservation was also higher for the LLM-based pathways, although measurement expressions remained the most persistent risk, particularly in table-based pages. Downstream tasks were not directly evaluated. The findings support the framework as a method for validating text-extraction pathways before reuse, rather than establishing a universal ranking of tools.</p>
	]]></content:encoded>

	<dc:title>Reframing Historical Text Extraction: A Cross-Pathway Validation of OCR, LLM-Assisted Correction, and Direct Multimodal Transcription</dc:title>
			<dc:creator>Cláudia M. Viana</dc:creator>
		<dc:identifier>doi: 10.3390/info17080722</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-25</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-25</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>722</prism:startingPage>
		<prism:doi>10.3390/info17080722</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/722</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/721">

	<title>Information, Vol. 17, Pages 721: Cumulative Online Reputation and Automobile Sales: Evidence from the Chinese Market</title>
	<link>https://www.mdpi.com/2078-2489/17/8/721</link>
	<description>Online consumer reviews provide an important source of information for automobile purchase decisions, yet relatively little is known about the informational value of cumulative electronic word-of-mouth (eWOM) ratings that reflect long-term online reputation. This study examines whether cumulative eWOM ratings are associated with subsequent automobile sales and explores their relationship with subsequent changes in monthly ratings and rating entropy. We combine monthly automobile sales data from Chezhu Zhijia with more than one million individual consumer reviews collected from Autohome between January 2013 and December 2025. Review-level data are aggregated to the automobile model-month level to construct cumulative eWOM measures, and the hypotheses are examined using two-way fixed-effects models. The results show that cumulative eWOM ratings are positively associated with subsequent automobile sales. Higher cumulative ratings are also associated with more favorable changes in subsequent monthly ratings and lower rating entropy. The positive association between cumulative eWOM ratings and automobile sales becomes stronger as product age increases and varies with cumulative rating entropy. These findings remain qualitatively unchanged across a broad set of robustness and additional analyses. This study highlights the informational value of cumulative online reputation for high-involvement durable goods and provides new evidence on the conditions under which accumulated consumer evaluations are associated with market outcomes.</description>
	<pubDate>2026-07-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 721: Cumulative Online Reputation and Automobile Sales: Evidence from the Chinese Market</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/721">doi: 10.3390/info17080721</a></p>
	<p>Authors:
		Xudong Liu
		Yuedan Geng
		Qiang Ye
		</p>
	<p>Online consumer reviews provide an important source of information for automobile purchase decisions, yet relatively little is known about the informational value of cumulative electronic word-of-mouth (eWOM) ratings that reflect long-term online reputation. This study examines whether cumulative eWOM ratings are associated with subsequent automobile sales and explores their relationship with subsequent changes in monthly ratings and rating entropy. We combine monthly automobile sales data from Chezhu Zhijia with more than one million individual consumer reviews collected from Autohome between January 2013 and December 2025. Review-level data are aggregated to the automobile model-month level to construct cumulative eWOM measures, and the hypotheses are examined using two-way fixed-effects models. The results show that cumulative eWOM ratings are positively associated with subsequent automobile sales. Higher cumulative ratings are also associated with more favorable changes in subsequent monthly ratings and lower rating entropy. The positive association between cumulative eWOM ratings and automobile sales becomes stronger as product age increases and varies with cumulative rating entropy. These findings remain qualitatively unchanged across a broad set of robustness and additional analyses. This study highlights the informational value of cumulative online reputation for high-involvement durable goods and provides new evidence on the conditions under which accumulated consumer evaluations are associated with market outcomes.</p>
	]]></content:encoded>

	<dc:title>Cumulative Online Reputation and Automobile Sales: Evidence from the Chinese Market</dc:title>
			<dc:creator>Xudong Liu</dc:creator>
			<dc:creator>Yuedan Geng</dc:creator>
			<dc:creator>Qiang Ye</dc:creator>
		<dc:identifier>doi: 10.3390/info17080721</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-24</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-24</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>721</prism:startingPage>
		<prism:doi>10.3390/info17080721</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/721</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/720">

	<title>Information, Vol. 17, Pages 720: The Blockchain-Based Multifunctional Educational Documents Verification System</title>
	<link>https://www.mdpi.com/2078-2489/17/8/720</link>
	<description>The digital transformation of higher education has heightened the need for reliable mechanisms to verify the authenticity, integrity, and independence of academic documents. This study presents the design and practical implementation of a blockchain-based, multifunctional educational document verification system for the higher education environment of the Republic of Kazakhstan. The proposed system is presented by a hybrid multi-layered architecture that integrates a frontend web portal, a C# ASP.NET backend service, a PostgreSQL off-chain database, a Smart Bridge integration subsystem, and an Ethereum-compatible blockchain layer with Solidity smart contracts. The system separates operational educational data from trust-sensitive verification records: student, graduate, catalog, and document metadata are stored off-chain, while selected transcript and diploma-related data are registered on-chain and linked to transaction hashes. The Smart Bridge subsystem enables secure interaction with state information systems via SOAP/XML and digital signatures, improving the reliability of personal data used in academic record processing. The blockchain implementation uses transaction hashes, event logs, BlockScout monitoring, and role-based smart-contract authorization to support traceability and tamper-resistant verification. Experimental implementation showed an average gas consumption of approximately 226,125 gas per transaction. The proposed system demonstrates that blockchain extends existing centralized educational infrastructures by adding a transparent, auditable, and user-accessible trust layer for academic document management and verification.</description>
	<pubDate>2026-07-24</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 720: The Blockchain-Based Multifunctional Educational Documents Verification System</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/720">doi: 10.3390/info17080720</a></p>
	<p>Authors:
		Olga Ussatova
		Vladislav Karyukin
		Yenlik Begimbayeva
		Galimkair Mutanov
		Zhanna Yessengaliyeva
		Yerlan Kistaubayev
		Medet Turdaliyev
		Daniyar Aitmukash
		Gulshat Baispay
		</p>
	<p>The digital transformation of higher education has heightened the need for reliable mechanisms to verify the authenticity, integrity, and independence of academic documents. This study presents the design and practical implementation of a blockchain-based, multifunctional educational document verification system for the higher education environment of the Republic of Kazakhstan. The proposed system is presented by a hybrid multi-layered architecture that integrates a frontend web portal, a C# ASP.NET backend service, a PostgreSQL off-chain database, a Smart Bridge integration subsystem, and an Ethereum-compatible blockchain layer with Solidity smart contracts. The system separates operational educational data from trust-sensitive verification records: student, graduate, catalog, and document metadata are stored off-chain, while selected transcript and diploma-related data are registered on-chain and linked to transaction hashes. The Smart Bridge subsystem enables secure interaction with state information systems via SOAP/XML and digital signatures, improving the reliability of personal data used in academic record processing. The blockchain implementation uses transaction hashes, event logs, BlockScout monitoring, and role-based smart-contract authorization to support traceability and tamper-resistant verification. Experimental implementation showed an average gas consumption of approximately 226,125 gas per transaction. The proposed system demonstrates that blockchain extends existing centralized educational infrastructures by adding a transparent, auditable, and user-accessible trust layer for academic document management and verification.</p>
	]]></content:encoded>

	<dc:title>The Blockchain-Based Multifunctional Educational Documents Verification System</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>Zhanna Yessengaliyeva</dc:creator>
			<dc:creator>Yerlan Kistaubayev</dc:creator>
			<dc:creator>Medet Turdaliyev</dc:creator>
			<dc:creator>Daniyar Aitmukash</dc:creator>
			<dc:creator>Gulshat Baispay</dc:creator>
		<dc:identifier>doi: 10.3390/info17080720</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-24</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-24</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>720</prism:startingPage>
		<prism:doi>10.3390/info17080720</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/720</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/719">

	<title>Information, Vol. 17, Pages 719: Causal Optimization and Reliability-Enhanced Fact-Tracking: A Privacy-Preserving Federated Approach to Misinformation Detection</title>
	<link>https://www.mdpi.com/2078-2489/17/8/719</link>
	<description>The high rate of growth of misinformation on decentralized platforms causes a risk to public confidence and the integrity of decisions and requires a system of verification that is not only accurate but can be causally informed and interpreted via proxy causal metrics, reliable, and privacy-safe as well. The state-of-the-art federated learning (FL)-based fact-verification models mainly use correlation-driven patterns and do not provide ways to deal with causal reasoning, measuring formal reliability, or being resilient to Byzantine adversaries. This paper proposes a unified framework called CORE-FACT (causal optimization and reliability-enhanced fact-tracking) that can be used to conduct interpretable and robust misinformation detection in a distributed environment by combining causally informed optimization with reliability-weighted federated optimization. The proposed three-tier architecture includes: (1) a causal graph construction module, where variational attention is utilized to learn directed relationships of claims and evidence; (2) a reliability-weighted federated optimization module, where Byzantine-resilient aggregation (adaptive trust scoring) is achieved; and (3) an adaptive fact-tracking module, which is used to achieve fusion of multi-source evidence by combining hierarchical consistency verification with knowledge-graph embeddings. Empirical testing on the LIAR and FEVER datasets shows that CORE-FACT achieves 94.7% and 96.3% accuracy, respectively, outperforming state-of-the-art baselines by 3.5 to 4.8 percentage points in accuracy, with 17% lower latency than GEAR and 31% lower latency than DAGNN, and 98.2% robustness against 30% Byzantine attacks. Under differential-privacy guarantees verified at &amp;amp;epsilon; = 10.96, &amp;amp;delta; = 10&amp;amp;minus;5 (Renyi DP composition, empirical membership inference validation committed for revision), CORE-FACT achieves a 31% reduction in false positives through explicit causally informed reasoning. These findings make CORE-FACT a scalable and interpretable framework that consolidates causal optimization, trustworthiness evaluation, and secure aggregation for next-generation federated misinformation detection.</description>
	<pubDate>2026-07-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 719: Causal Optimization and Reliability-Enhanced Fact-Tracking: A Privacy-Preserving Federated Approach to Misinformation Detection</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/719">doi: 10.3390/info17080719</a></p>
	<p>Authors:
		Danah Algawiaz
		</p>
	<p>The high rate of growth of misinformation on decentralized platforms causes a risk to public confidence and the integrity of decisions and requires a system of verification that is not only accurate but can be causally informed and interpreted via proxy causal metrics, reliable, and privacy-safe as well. The state-of-the-art federated learning (FL)-based fact-verification models mainly use correlation-driven patterns and do not provide ways to deal with causal reasoning, measuring formal reliability, or being resilient to Byzantine adversaries. This paper proposes a unified framework called CORE-FACT (causal optimization and reliability-enhanced fact-tracking) that can be used to conduct interpretable and robust misinformation detection in a distributed environment by combining causally informed optimization with reliability-weighted federated optimization. The proposed three-tier architecture includes: (1) a causal graph construction module, where variational attention is utilized to learn directed relationships of claims and evidence; (2) a reliability-weighted federated optimization module, where Byzantine-resilient aggregation (adaptive trust scoring) is achieved; and (3) an adaptive fact-tracking module, which is used to achieve fusion of multi-source evidence by combining hierarchical consistency verification with knowledge-graph embeddings. Empirical testing on the LIAR and FEVER datasets shows that CORE-FACT achieves 94.7% and 96.3% accuracy, respectively, outperforming state-of-the-art baselines by 3.5 to 4.8 percentage points in accuracy, with 17% lower latency than GEAR and 31% lower latency than DAGNN, and 98.2% robustness against 30% Byzantine attacks. Under differential-privacy guarantees verified at &amp;amp;epsilon; = 10.96, &amp;amp;delta; = 10&amp;amp;minus;5 (Renyi DP composition, empirical membership inference validation committed for revision), CORE-FACT achieves a 31% reduction in false positives through explicit causally informed reasoning. These findings make CORE-FACT a scalable and interpretable framework that consolidates causal optimization, trustworthiness evaluation, and secure aggregation for next-generation federated misinformation detection.</p>
	]]></content:encoded>

	<dc:title>Causal Optimization and Reliability-Enhanced Fact-Tracking: A Privacy-Preserving Federated Approach to Misinformation Detection</dc:title>
			<dc:creator>Danah Algawiaz</dc:creator>
		<dc:identifier>doi: 10.3390/info17080719</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>719</prism:startingPage>
		<prism:doi>10.3390/info17080719</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/719</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/718">

	<title>Information, Vol. 17, Pages 718: Persistent Highway&amp;ndash;Rail Grade Crossing Incidents: A Spatial Analytics and Explainable Machine-Learning Framework</title>
	<link>https://www.mdpi.com/2078-2489/17/8/718</link>
	<description>Highway&amp;amp;ndash;rail grade crossing (HRGC) incidents in the United States declined substantially for several decades before stabilizing in recent years. Understanding this persistence is important because future safety improvements may depend on identifying locations where incident occurrence remains resistant to further reduction. This study developed an integrated framework to characterize persistent HRGC incident environments using 50 years (1976&amp;amp;ndash;2025) of Federal Railroad Administration incident records. Trend, structural-break, variance, and stationarity tests were first applied to determine whether the historical decline transitioned into a distinct persistence regime. A county-level persistence index (PI) was then developed to quantify the combined effects of incident burden and resistance to decline during the plateau period. Distributional analysis characterized the statistical behavior of the PI, while global and local Moran&amp;amp;rsquo;s I statistics evaluated its spatial organization. Explainable machine learning methods were subsequently used to identify incident characteristics associated with elevated persistence. The results identified a statistically significant regime change around 2010. Prior to 2010, incidents exhibited a strong declining trend, whereas the subsequent period displayed a statistically significant but substantially weaker decline, lower variance, and behavior consistent with a persistence regime characterized by a markedly attenuated rate of improvement. The PI followed a strongly right-skewed distribution that was best represented by a bounded heavy-tailed unit log-logistic model, indicating that persistence is concentrated within a relatively small subset of counties. Spatial analysis revealed significant positive spatial autocorrelation (Moran&amp;amp;rsquo;s I = 0.180, p = 0.001) and geographically coherent clusters concentrated primarily in the southeastern United States and several major freight-oriented regions. Explainable machine learning models identified train-operating characteristics, warning device contexts, movement patterns, and temporal conditions as key attributes associated with high-persistence counties. The findings demonstrate that the post-2010 incident plateau is sustained disproportionately by a limited number of geographically concentrated environments and provide a framework for supporting more targeted safety interventions.</description>
	<pubDate>2026-07-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 718: Persistent Highway&amp;ndash;Rail Grade Crossing Incidents: A Spatial Analytics and Explainable Machine-Learning Framework</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/718">doi: 10.3390/info17080718</a></p>
	<p>Authors:
		Raj Bridgelall
		</p>
	<p>Highway&amp;amp;ndash;rail grade crossing (HRGC) incidents in the United States declined substantially for several decades before stabilizing in recent years. Understanding this persistence is important because future safety improvements may depend on identifying locations where incident occurrence remains resistant to further reduction. This study developed an integrated framework to characterize persistent HRGC incident environments using 50 years (1976&amp;amp;ndash;2025) of Federal Railroad Administration incident records. Trend, structural-break, variance, and stationarity tests were first applied to determine whether the historical decline transitioned into a distinct persistence regime. A county-level persistence index (PI) was then developed to quantify the combined effects of incident burden and resistance to decline during the plateau period. Distributional analysis characterized the statistical behavior of the PI, while global and local Moran&amp;amp;rsquo;s I statistics evaluated its spatial organization. Explainable machine learning methods were subsequently used to identify incident characteristics associated with elevated persistence. The results identified a statistically significant regime change around 2010. Prior to 2010, incidents exhibited a strong declining trend, whereas the subsequent period displayed a statistically significant but substantially weaker decline, lower variance, and behavior consistent with a persistence regime characterized by a markedly attenuated rate of improvement. The PI followed a strongly right-skewed distribution that was best represented by a bounded heavy-tailed unit log-logistic model, indicating that persistence is concentrated within a relatively small subset of counties. Spatial analysis revealed significant positive spatial autocorrelation (Moran&amp;amp;rsquo;s I = 0.180, p = 0.001) and geographically coherent clusters concentrated primarily in the southeastern United States and several major freight-oriented regions. Explainable machine learning models identified train-operating characteristics, warning device contexts, movement patterns, and temporal conditions as key attributes associated with high-persistence counties. The findings demonstrate that the post-2010 incident plateau is sustained disproportionately by a limited number of geographically concentrated environments and provide a framework for supporting more targeted safety interventions.</p>
	]]></content:encoded>

	<dc:title>Persistent Highway&amp;amp;ndash;Rail Grade Crossing Incidents: A Spatial Analytics and Explainable Machine-Learning Framework</dc:title>
			<dc:creator>Raj Bridgelall</dc:creator>
		<dc:identifier>doi: 10.3390/info17080718</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>718</prism:startingPage>
		<prism:doi>10.3390/info17080718</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/718</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/717">

	<title>Information, Vol. 17, Pages 717: Ultrasonic Morphology-Based Characterization of Rebar Depth and Effective Diameter in Reinforced Concrete</title>
	<link>https://www.mdpi.com/2078-2489/17/8/717</link>
	<description>An experimental morphology-based information extraction methodology is presented for locating reinforcing bars and estimating their effective ultrasonic scattering diameters in reinforced concrete (RC) members using ultrasonic pitch&amp;amp;ndash;catch (UPC) non-destructive testing combined with synthetic aperture focusing technique (SAFT) reconstruction. Reinforced concrete slab specimens with known reinforcement layouts were constructed and tested using a commercial ultrasonic device equipped with dry point contact shear wave transducers in a pitch&amp;amp;ndash;catch configuration. The collected ultrasonic data were post-processed using an in-house software package to reconstruct two-dimensional (2D) SAFT images of the specimens. In the reconstructed images, embedded rebars consistently produced characteristic bipolar scattering responses composed of dominant trough&amp;amp;ndash;crest waveform pairs. Based on these repeatable scattering response features, an empirical morphology-based procedure was developed in which rebar depth was estimated from the midpoint of the dominant trough&amp;amp;ndash;crest pair, while the effective ultrasonic scattering diameter was characterized using their vertical separation. The experimental results obtained from twelve reinforced concrete slab specimens demonstrated reliable depth estimation and a strong monotonic relationship between reconstructed scattering response width and nominal rebar diameter under the investigated testing conditions. Regression analysis indicated that larger rebars generally produced broader reconstructed bipolar scattering responses due to cylindrical wave interaction, diffraction, interference, finite transducer aperture effects, and SAFT reconstruction characteristics. The proposed methodology does not attempt to reconstruct the exact physical boundary of the reinforcement or solve the full elastodynamic inverse problem. Instead, the proposed methodology provides a practical and computationally efficient morphology-based information extraction framework that transforms reconstructed ultrasonic scattering responses into quantitative morphological descriptors for embedded reinforcement characterization. By extracting repeatable scattering response features from SAFT-reconstructed images and establishing an empirical mapping between these descriptors and reinforcement characteristics, the proposed approach enables the quantitative interpretation of ultrasonic images without requiring computationally intensive full waveform inversion.</description>
	<pubDate>2026-07-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 717: Ultrasonic Morphology-Based Characterization of Rebar Depth and Effective Diameter in Reinforced Concrete</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/717">doi: 10.3390/info17080717</a></p>
	<p>Authors:
		Wael Zatar
		Hien Nghiem
		</p>
	<p>An experimental morphology-based information extraction methodology is presented for locating reinforcing bars and estimating their effective ultrasonic scattering diameters in reinforced concrete (RC) members using ultrasonic pitch&amp;amp;ndash;catch (UPC) non-destructive testing combined with synthetic aperture focusing technique (SAFT) reconstruction. Reinforced concrete slab specimens with known reinforcement layouts were constructed and tested using a commercial ultrasonic device equipped with dry point contact shear wave transducers in a pitch&amp;amp;ndash;catch configuration. The collected ultrasonic data were post-processed using an in-house software package to reconstruct two-dimensional (2D) SAFT images of the specimens. In the reconstructed images, embedded rebars consistently produced characteristic bipolar scattering responses composed of dominant trough&amp;amp;ndash;crest waveform pairs. Based on these repeatable scattering response features, an empirical morphology-based procedure was developed in which rebar depth was estimated from the midpoint of the dominant trough&amp;amp;ndash;crest pair, while the effective ultrasonic scattering diameter was characterized using their vertical separation. The experimental results obtained from twelve reinforced concrete slab specimens demonstrated reliable depth estimation and a strong monotonic relationship between reconstructed scattering response width and nominal rebar diameter under the investigated testing conditions. Regression analysis indicated that larger rebars generally produced broader reconstructed bipolar scattering responses due to cylindrical wave interaction, diffraction, interference, finite transducer aperture effects, and SAFT reconstruction characteristics. The proposed methodology does not attempt to reconstruct the exact physical boundary of the reinforcement or solve the full elastodynamic inverse problem. Instead, the proposed methodology provides a practical and computationally efficient morphology-based information extraction framework that transforms reconstructed ultrasonic scattering responses into quantitative morphological descriptors for embedded reinforcement characterization. By extracting repeatable scattering response features from SAFT-reconstructed images and establishing an empirical mapping between these descriptors and reinforcement characteristics, the proposed approach enables the quantitative interpretation of ultrasonic images without requiring computationally intensive full waveform inversion.</p>
	]]></content:encoded>

	<dc:title>Ultrasonic Morphology-Based Characterization of Rebar Depth and Effective Diameter in Reinforced Concrete</dc:title>
			<dc:creator>Wael Zatar</dc:creator>
			<dc:creator>Hien Nghiem</dc:creator>
		<dc:identifier>doi: 10.3390/info17080717</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>717</prism:startingPage>
		<prism:doi>10.3390/info17080717</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/717</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/8/716">

	<title>Information, Vol. 17, Pages 716: Evaluating an Augmented Reality Educational Application for Earthquake Preparedness Among International Visitors and Newly Arrived Foreign Residents in Japan</title>
	<link>https://www.mdpi.com/2078-2489/17/8/716</link>
	<description>Japan is one of the most earthquake-prone countries in the world. The 2011 Great East Japan Earthquake alone caused nearly 20,000 deaths and missing persons. International visitors and newly arrived foreign residents in Japan may face heightened risk during earthquakes, as limited prior experience with earthquakes and limited Japanese-language proficiency can restrict access to essential safety information. In addition, because disaster-preparedness education is often insufficient in countries with low disaster risk, they may be especially vulnerable in emergencies. This study designed, developed, and evaluated an augmented reality (AR) application intended to provide earthquake-preparedness and survival guidance in the Japanese context. The application was evaluated using a pre-test/post-test design with 40 participants from 10 countries, who completed a 14-item multiple-choice disaster-preparedness knowledge test and a user satisfaction survey. Participants&amp;amp;rsquo; knowledge scores improved significantly from the pre-test to the post-test (t(39) = 8.20, p &amp;amp;lt; 0.001), with a large effect size (Cohen&amp;amp;rsquo;s d = 1.30), and participants reported high satisfaction (4.55/5, SD = 0.61). These results suggest the potential of AR as an accessible educational approach for enhancing earthquake-preparedness knowledge among international visitors and newly arrived foreign residents in earthquake-prone regions.</description>
	<pubDate>2026-07-23</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 716: Evaluating an Augmented Reality Educational Application for Earthquake Preparedness Among International Visitors and Newly Arrived Foreign Residents in Japan</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/8/716">doi: 10.3390/info17080716</a></p>
	<p>Authors:
		Gowit Chanaken
		Osamu Uchida
		</p>
	<p>Japan is one of the most earthquake-prone countries in the world. The 2011 Great East Japan Earthquake alone caused nearly 20,000 deaths and missing persons. International visitors and newly arrived foreign residents in Japan may face heightened risk during earthquakes, as limited prior experience with earthquakes and limited Japanese-language proficiency can restrict access to essential safety information. In addition, because disaster-preparedness education is often insufficient in countries with low disaster risk, they may be especially vulnerable in emergencies. This study designed, developed, and evaluated an augmented reality (AR) application intended to provide earthquake-preparedness and survival guidance in the Japanese context. The application was evaluated using a pre-test/post-test design with 40 participants from 10 countries, who completed a 14-item multiple-choice disaster-preparedness knowledge test and a user satisfaction survey. Participants&amp;amp;rsquo; knowledge scores improved significantly from the pre-test to the post-test (t(39) = 8.20, p &amp;amp;lt; 0.001), with a large effect size (Cohen&amp;amp;rsquo;s d = 1.30), and participants reported high satisfaction (4.55/5, SD = 0.61). These results suggest the potential of AR as an accessible educational approach for enhancing earthquake-preparedness knowledge among international visitors and newly arrived foreign residents in earthquake-prone regions.</p>
	]]></content:encoded>

	<dc:title>Evaluating an Augmented Reality Educational Application for Earthquake Preparedness Among International Visitors and Newly Arrived Foreign Residents in Japan</dc:title>
			<dc:creator>Gowit Chanaken</dc:creator>
			<dc:creator>Osamu Uchida</dc:creator>
		<dc:identifier>doi: 10.3390/info17080716</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-23</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-23</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>8</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>716</prism:startingPage>
		<prism:doi>10.3390/info17080716</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/8/716</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/715">

	<title>Information, Vol. 17, Pages 715: From Profiles to Promising Paths: A Semantic Group Recommender for Novel Academic Topic Discovery</title>
	<link>https://www.mdpi.com/2078-2489/17/7/715</link>
	<description>Scientific production is expanding so quickly that research teams are struggling to track advances beyond their immediate specialization, especially in interdisciplinary areas where relevant work is scattered across venues and vocabularies. To reduce this overload at the group level, we propose an end-to-end pipeline that transforms structured bibliographic metadata into actionable topic recommendations for research teams. Starting from Scopus records, the method normalizes scholarly text, builds semantic author profiles using Sentence&amp;amp;ndash;BERT representations coupled with interpretable keyword descriptors, and forms candidate groups from co-authorship signals and profile similarity. For each group, the approach applies embedding-based topic modeling to generate candidate themes and ranks them using a relevance&amp;amp;ndash;novelty trade-off, enabling teams to surface directions that remain aligned with their collective agenda while still encouraging exploration beyond dominant or highly popular topics. Empirical evidence on a Scopus-derived corpus shows that embedding-aware descriptors support cleaner, semantically faithful representations than frequency-based baselines, strengthening downstream topic discovery and producing compact topic lists that are easier for teams to inspect, discuss, and adopt in collaborative planning.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 715: From Profiles to Promising Paths: A Semantic Group Recommender for Novel Academic Topic Discovery</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/715">doi: 10.3390/info17070715</a></p>
	<p>Authors:
		Carlos Ayala-Tipan
		Lorena Recalde
		Edison Loza-Aguirre
		</p>
	<p>Scientific production is expanding so quickly that research teams are struggling to track advances beyond their immediate specialization, especially in interdisciplinary areas where relevant work is scattered across venues and vocabularies. To reduce this overload at the group level, we propose an end-to-end pipeline that transforms structured bibliographic metadata into actionable topic recommendations for research teams. Starting from Scopus records, the method normalizes scholarly text, builds semantic author profiles using Sentence&amp;amp;ndash;BERT representations coupled with interpretable keyword descriptors, and forms candidate groups from co-authorship signals and profile similarity. For each group, the approach applies embedding-based topic modeling to generate candidate themes and ranks them using a relevance&amp;amp;ndash;novelty trade-off, enabling teams to surface directions that remain aligned with their collective agenda while still encouraging exploration beyond dominant or highly popular topics. Empirical evidence on a Scopus-derived corpus shows that embedding-aware descriptors support cleaner, semantically faithful representations than frequency-based baselines, strengthening downstream topic discovery and producing compact topic lists that are easier for teams to inspect, discuss, and adopt in collaborative planning.</p>
	]]></content:encoded>

	<dc:title>From Profiles to Promising Paths: A Semantic Group Recommender for Novel Academic Topic Discovery</dc:title>
			<dc:creator>Carlos Ayala-Tipan</dc:creator>
			<dc:creator>Lorena Recalde</dc:creator>
			<dc:creator>Edison Loza-Aguirre</dc:creator>
		<dc:identifier>doi: 10.3390/info17070715</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>715</prism:startingPage>
		<prism:doi>10.3390/info17070715</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/715</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/714">

	<title>Information, Vol. 17, Pages 714: A Phase-Coherent Four-Stage Pipeline for the Dereverberation of Qur&amp;aacute;nic Recitation</title>
	<link>https://www.mdpi.com/2078-2489/17/7/714</link>
	<description>The accuracy of spectro-temporal features for Makhaarij al-Huroof and Sifaat distinguishes between the ten canonical Qira&amp;amp;aacute;t recitation styles of the Holy Quran. However, real-world room reverberations blur formant contours and corrupt inter-word energies, thus making Qiraat discrimination difficult. The current dereverberation methods were designed to work under ordinary speech conditions and are not capable of preserving phonetic qualities for domain-specific purposes. This paper introduces a four-step, phase-consistent signal-processing approach prioritizing phonetic preservation over direct reverberation suppression. The four steps are: (1) adaptive noise-floor attenuation; (2) soft-voice activity detection using power-law boundary decay; (3) application-specific spectral contour adjustment from clean Quranic reference audio; and (4) Griffin&amp;amp;ndash;Lim algorithm-based phase correction. A total of 48 real-world room recordings were utilized for the evaluation of this approach based on Energy Ratio (ER), Spectral Contrast (SC), and Spectral Contour Stability (SCS)&amp;amp;mdash;measures specific to the Quran audio domain&amp;amp;mdash;alongside conventional speech-quality metrics. The proposed approach yielded the highest scores in three of seven metrics, namely SC (+40.11), SCS (+822.94), and PESQ (+1.251), alongside the second-highest Energy Ratio (+19.58 dB), while being superior to Spectral Subtraction, Wiener Filtering, and WPE Dereverberation approaches. Moreover, the perceptual enhancement was verified in a synthetic controlled experiment where the proposed approach scored an improved PESQ metric (+2.495; SNR &amp;amp;minus;1.874 dB). The results illustrate the fact that an optimization for general-purpose metrics does not necessarily ensure phonetic preservation required for specific classification.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 714: A Phase-Coherent Four-Stage Pipeline for the Dereverberation of Qur&amp;aacute;nic Recitation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/714">doi: 10.3390/info17070714</a></p>
	<p>Authors:
		Osama Al Maaini
		Khizar Hayat
		Khalil Al Ruqeishi
		Baptiste Magnier
		</p>
	<p>The accuracy of spectro-temporal features for Makhaarij al-Huroof and Sifaat distinguishes between the ten canonical Qira&amp;amp;aacute;t recitation styles of the Holy Quran. However, real-world room reverberations blur formant contours and corrupt inter-word energies, thus making Qiraat discrimination difficult. The current dereverberation methods were designed to work under ordinary speech conditions and are not capable of preserving phonetic qualities for domain-specific purposes. This paper introduces a four-step, phase-consistent signal-processing approach prioritizing phonetic preservation over direct reverberation suppression. The four steps are: (1) adaptive noise-floor attenuation; (2) soft-voice activity detection using power-law boundary decay; (3) application-specific spectral contour adjustment from clean Quranic reference audio; and (4) Griffin&amp;amp;ndash;Lim algorithm-based phase correction. A total of 48 real-world room recordings were utilized for the evaluation of this approach based on Energy Ratio (ER), Spectral Contrast (SC), and Spectral Contour Stability (SCS)&amp;amp;mdash;measures specific to the Quran audio domain&amp;amp;mdash;alongside conventional speech-quality metrics. The proposed approach yielded the highest scores in three of seven metrics, namely SC (+40.11), SCS (+822.94), and PESQ (+1.251), alongside the second-highest Energy Ratio (+19.58 dB), while being superior to Spectral Subtraction, Wiener Filtering, and WPE Dereverberation approaches. Moreover, the perceptual enhancement was verified in a synthetic controlled experiment where the proposed approach scored an improved PESQ metric (+2.495; SNR &amp;amp;minus;1.874 dB). The results illustrate the fact that an optimization for general-purpose metrics does not necessarily ensure phonetic preservation required for specific classification.</p>
	]]></content:encoded>

	<dc:title>A Phase-Coherent Four-Stage Pipeline for the Dereverberation of Qur&amp;amp;aacute;nic Recitation</dc:title>
			<dc:creator>Osama Al Maaini</dc:creator>
			<dc:creator>Khizar Hayat</dc:creator>
			<dc:creator>Khalil Al Ruqeishi</dc:creator>
			<dc:creator>Baptiste Magnier</dc:creator>
		<dc:identifier>doi: 10.3390/info17070714</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>714</prism:startingPage>
		<prism:doi>10.3390/info17070714</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/714</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/713">

	<title>Information, Vol. 17, Pages 713: Cryptography-Based Security Authentication and Privacy Preservation of Cyber-Physical Power Systems: An Overview</title>
	<link>https://www.mdpi.com/2078-2489/17/7/713</link>
	<description>Cyber-physical power systems (CPPSs) are a crucial component of smart grids, integrating physical power systems with advanced information and communication technologies to achieve efficient, reliable, and intelligent energy management and control. However, with the widespread deployment of information technology, CPPSs face increasingly severe security threats and privacy protection challenges, such as data leakage, identity forgery, and impersonation, which can compromise the secure and stable operation of CPPSs. To counter these threats and protect privacy, cryptographic technique is developed to provide fundamental and powerful tools, supporting secure authentication, data integrity checking, privacy preservation, and trusted communication between connected devices in CPPSs. We systematically review the research progress on security authentication and privacy protection in CPPSs from a cryptographic perspective. Our survey analyzes the major security threats faced by CPPSs, along with the impact of various attacks on system data. We explore mainstream cryptographic algorithms, including digital signatures, key agreement protocols, signcryption authentication, homomorphic encryption, and blockchain-based security mechanisms that are capable of resisting cyber attacks and ensuring reliable decision-making and control in CPPSs. This work also provides the trends and challenges regarding the intersection of cryptography and networked control, blockchain scalability, and convergence of cryptography and artificial intelligence in CPPSs.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 713: Cryptography-Based Security Authentication and Privacy Preservation of Cyber-Physical Power Systems: An Overview</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/713">doi: 10.3390/info17070713</a></p>
	<p>Authors:
		Cheng Jiang
		Jianyong Bi
		Huiqun Yu
		Mi Wen
		Lei Wu
		Rolf Findeisen
		</p>
	<p>Cyber-physical power systems (CPPSs) are a crucial component of smart grids, integrating physical power systems with advanced information and communication technologies to achieve efficient, reliable, and intelligent energy management and control. However, with the widespread deployment of information technology, CPPSs face increasingly severe security threats and privacy protection challenges, such as data leakage, identity forgery, and impersonation, which can compromise the secure and stable operation of CPPSs. To counter these threats and protect privacy, cryptographic technique is developed to provide fundamental and powerful tools, supporting secure authentication, data integrity checking, privacy preservation, and trusted communication between connected devices in CPPSs. We systematically review the research progress on security authentication and privacy protection in CPPSs from a cryptographic perspective. Our survey analyzes the major security threats faced by CPPSs, along with the impact of various attacks on system data. We explore mainstream cryptographic algorithms, including digital signatures, key agreement protocols, signcryption authentication, homomorphic encryption, and blockchain-based security mechanisms that are capable of resisting cyber attacks and ensuring reliable decision-making and control in CPPSs. This work also provides the trends and challenges regarding the intersection of cryptography and networked control, blockchain scalability, and convergence of cryptography and artificial intelligence in CPPSs.</p>
	]]></content:encoded>

	<dc:title>Cryptography-Based Security Authentication and Privacy Preservation of Cyber-Physical Power Systems: An Overview</dc:title>
			<dc:creator>Cheng Jiang</dc:creator>
			<dc:creator>Jianyong Bi</dc:creator>
			<dc:creator>Huiqun Yu</dc:creator>
			<dc:creator>Mi Wen</dc:creator>
			<dc:creator>Lei Wu</dc:creator>
			<dc:creator>Rolf Findeisen</dc:creator>
		<dc:identifier>doi: 10.3390/info17070713</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>713</prism:startingPage>
		<prism:doi>10.3390/info17070713</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/713</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/712">

	<title>Information, Vol. 17, Pages 712: Transformer-Based Language Models for Clinical Decision Support Using Clinical Notes: A Scoping Review</title>
	<link>https://www.mdpi.com/2078-2489/17/7/712</link>
	<description>Background/Objectives: This scoping review examined recent evidence on the use of transformer-based language models, encompassing encoder-only architectures (e.g., BERT and its clinical variants) and generative large language models (LLMs; e.g., GPT-4 and Llama), to support clinical decision making from unstructured clinical notes, with implications for behavioral-health services where narrative documentation is central. Methods: Following PRISMA-ScR guidelines, PubMed, PsycINFO, and Web of Science were searched for peer-reviewed studies published between 1 January 2023, and 5 August 2025. Studies applying transformer-based language models to clinical narratives for healthcare tasks and reporting evaluative outcomes were included. We extracted data on clinical tasks, model architectures, enhancement strategies, and evaluation metrics; mapped each study by primary purpose, care setting, and primary model approach; and charted reported validation design, direct human comparison, fairness assessment, workflow evaluation, and clinical deployment. Results: Thirty-six studies were included. Information extraction/de-identification and classification/prediction predominated, whereas summarization/generation was less commonly represented. Model approaches appeared to align with task characteristics: encoder-only and decoder-only systems were frequently used for extraction, encoder&amp;amp;ndash;decoder systems for generation, and hybrid or pipeline-based approaches for classification and prediction. Standard task-specific metrics (e.g., F1 and AUROC) predominated, whereas evidence beyond retrospective task performance, including direct human comparison, fairness assessment, workflow evaluation, clinical deployment, and temporal or external validation, was rare. No included study evaluated a transformer-based language model application within a behavioral-health service or behavioral-health workflow. Conclusions: Transformer-based language models have been applied across diverse clinical-note tasks, but the evidence base more strongly supports retrospective task feasibility than transportability, equitable performance, workflow benefit, or safe clinical deployment. Future research should prioritize transparent reference standards, external and prospective validation, clinically meaningful human comparison, and equity-focused evaluation, including direct studies in behavioral-health services.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 712: Transformer-Based Language Models for Clinical Decision Support Using Clinical Notes: A Scoping Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/712">doi: 10.3390/info17070712</a></p>
	<p>Authors:
		Saahoon Hong
		Hunhui Na
		</p>
	<p>Background/Objectives: This scoping review examined recent evidence on the use of transformer-based language models, encompassing encoder-only architectures (e.g., BERT and its clinical variants) and generative large language models (LLMs; e.g., GPT-4 and Llama), to support clinical decision making from unstructured clinical notes, with implications for behavioral-health services where narrative documentation is central. Methods: Following PRISMA-ScR guidelines, PubMed, PsycINFO, and Web of Science were searched for peer-reviewed studies published between 1 January 2023, and 5 August 2025. Studies applying transformer-based language models to clinical narratives for healthcare tasks and reporting evaluative outcomes were included. We extracted data on clinical tasks, model architectures, enhancement strategies, and evaluation metrics; mapped each study by primary purpose, care setting, and primary model approach; and charted reported validation design, direct human comparison, fairness assessment, workflow evaluation, and clinical deployment. Results: Thirty-six studies were included. Information extraction/de-identification and classification/prediction predominated, whereas summarization/generation was less commonly represented. Model approaches appeared to align with task characteristics: encoder-only and decoder-only systems were frequently used for extraction, encoder&amp;amp;ndash;decoder systems for generation, and hybrid or pipeline-based approaches for classification and prediction. Standard task-specific metrics (e.g., F1 and AUROC) predominated, whereas evidence beyond retrospective task performance, including direct human comparison, fairness assessment, workflow evaluation, clinical deployment, and temporal or external validation, was rare. No included study evaluated a transformer-based language model application within a behavioral-health service or behavioral-health workflow. Conclusions: Transformer-based language models have been applied across diverse clinical-note tasks, but the evidence base more strongly supports retrospective task feasibility than transportability, equitable performance, workflow benefit, or safe clinical deployment. Future research should prioritize transparent reference standards, external and prospective validation, clinically meaningful human comparison, and equity-focused evaluation, including direct studies in behavioral-health services.</p>
	]]></content:encoded>

	<dc:title>Transformer-Based Language Models for Clinical Decision Support Using Clinical Notes: A Scoping Review</dc:title>
			<dc:creator>Saahoon Hong</dc:creator>
			<dc:creator>Hunhui Na</dc:creator>
		<dc:identifier>doi: 10.3390/info17070712</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>712</prism:startingPage>
		<prism:doi>10.3390/info17070712</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/712</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/711">

	<title>Information, Vol. 17, Pages 711: A Preliminary Design Framework for Motivational Robots in Higher Education Japanese-Language E-Learning: A Theory-Guided Synthesis and Structured Expert Review</title>
	<link>https://www.mdpi.com/2078-2489/17/7/711</link>
	<description>Sustaining learner motivation remains a persistent challenge in higher education Japanese-language e-learning, where learners often study with limited social presence and personalized encouragement. This paper proposes a preliminary Design Framework for Motivational Robots in E-Learning (DFMRE), derived through a retrospective, theory-guided synthesis of two previously published empirical studies on robot-assisted Japanese-language learning. The synthesis interprets the prior findings through Self-Determination Theory and self-efficacy theory and formulates five candidate design principles: human-affine compact hardware, multi-level learner-selectable gestures, calibrated vocal encouragement, learner-initiated interaction protocol, and content-independent system integration. To provide an initial external check, nine domain experts with diverse backgrounds in education, educational technology, human&amp;amp;ndash;robot interaction, and related fields provided a preliminary appraisal of the principles in terms of clarity, feasibility, transferability, and overall usefulness. The framework received broadly favorable ratings, including a mean overall usefulness score of 4.33 on a 5-point scale, while expert comments highlighted the need for clearer operational definitions and flexible interaction modes. Because the empirical base consists of two small-sample Japanese-language learning studies conducted at one institution using one robot platform, DFMRE should be read as an early, context-grounded, falsifiable proposal rather than as a confirmed model for higher education e-learning in general.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 711: A Preliminary Design Framework for Motivational Robots in Higher Education Japanese-Language E-Learning: A Theory-Guided Synthesis and Structured Expert Review</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/711">doi: 10.3390/info17070711</a></p>
	<p>Authors:
		Pengfei Lyu
		Wei Xie
		Toshio Eisaka
		</p>
	<p>Sustaining learner motivation remains a persistent challenge in higher education Japanese-language e-learning, where learners often study with limited social presence and personalized encouragement. This paper proposes a preliminary Design Framework for Motivational Robots in E-Learning (DFMRE), derived through a retrospective, theory-guided synthesis of two previously published empirical studies on robot-assisted Japanese-language learning. The synthesis interprets the prior findings through Self-Determination Theory and self-efficacy theory and formulates five candidate design principles: human-affine compact hardware, multi-level learner-selectable gestures, calibrated vocal encouragement, learner-initiated interaction protocol, and content-independent system integration. To provide an initial external check, nine domain experts with diverse backgrounds in education, educational technology, human&amp;amp;ndash;robot interaction, and related fields provided a preliminary appraisal of the principles in terms of clarity, feasibility, transferability, and overall usefulness. The framework received broadly favorable ratings, including a mean overall usefulness score of 4.33 on a 5-point scale, while expert comments highlighted the need for clearer operational definitions and flexible interaction modes. Because the empirical base consists of two small-sample Japanese-language learning studies conducted at one institution using one robot platform, DFMRE should be read as an early, context-grounded, falsifiable proposal rather than as a confirmed model for higher education e-learning in general.</p>
	]]></content:encoded>

	<dc:title>A Preliminary Design Framework for Motivational Robots in Higher Education Japanese-Language E-Learning: A Theory-Guided Synthesis and Structured Expert Review</dc:title>
			<dc:creator>Pengfei Lyu</dc:creator>
			<dc:creator>Wei Xie</dc:creator>
			<dc:creator>Toshio Eisaka</dc:creator>
		<dc:identifier>doi: 10.3390/info17070711</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>711</prism:startingPage>
		<prism:doi>10.3390/info17070711</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/711</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/710">

	<title>Information, Vol. 17, Pages 710: BiTE: A Bitemporal Event-Centered Database Framework for Dynamic Aeronautical Information State Management</title>
	<link>https://www.mdpi.com/2078-2489/17/7/710</link>
	<description>Dynamic aeronautical information is still widely disseminated through textual Notice to Air Missions (NOTAMs), while message-oriented storage cannot directly maintain the evolving states of affected objects. The objective of this study is to determine whether NOTAM-derived object events can be organized into traceable bitemporal states that support accurate and efficient current and historical access. To this end, this paper proposes BiTE, a bitemporal event-centered database framework that connects object-level event evidence, historical state versions, and materialized current-state projections. By integrating business and system time with NOTAM-specific lifecycle rules, BiTE supports state maintenance, historical reconstruction, and source traceability. A MongoDB-based prototype was evaluated using 44,591 NOTAMs from five major U.S. aerodromes. Independent manual validation showed 96.14&amp;amp;ndash;100% agreement across object identification and lifecycle-maintenance tasks. Across 1500 manually verified queries, BiTE achieved F1 scores of 99.43% and 98.66% for current-state and airport-overview retrieval, respectively, and a historical hit rate of 95.80%, outperforming representative message-oriented, relational-bitemporal, and RDF-based implementations. Mean query latency remained below 3.7 ms, while functionally equivalent ablations confirmed the performance contribution of the layered architecture. These results demonstrate that BiTE enables accurate, traceable, and efficient object-state management for dynamic aeronautical information.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 710: BiTE: A Bitemporal Event-Centered Database Framework for Dynamic Aeronautical Information State Management</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/710">doi: 10.3390/info17070710</a></p>
	<p>Authors:
		Tianyue Wei
		Xin Lai
		Yidan Liang
		Chengwei Zhang
		Rui Kang
		</p>
	<p>Dynamic aeronautical information is still widely disseminated through textual Notice to Air Missions (NOTAMs), while message-oriented storage cannot directly maintain the evolving states of affected objects. The objective of this study is to determine whether NOTAM-derived object events can be organized into traceable bitemporal states that support accurate and efficient current and historical access. To this end, this paper proposes BiTE, a bitemporal event-centered database framework that connects object-level event evidence, historical state versions, and materialized current-state projections. By integrating business and system time with NOTAM-specific lifecycle rules, BiTE supports state maintenance, historical reconstruction, and source traceability. A MongoDB-based prototype was evaluated using 44,591 NOTAMs from five major U.S. aerodromes. Independent manual validation showed 96.14&amp;amp;ndash;100% agreement across object identification and lifecycle-maintenance tasks. Across 1500 manually verified queries, BiTE achieved F1 scores of 99.43% and 98.66% for current-state and airport-overview retrieval, respectively, and a historical hit rate of 95.80%, outperforming representative message-oriented, relational-bitemporal, and RDF-based implementations. Mean query latency remained below 3.7 ms, while functionally equivalent ablations confirmed the performance contribution of the layered architecture. These results demonstrate that BiTE enables accurate, traceable, and efficient object-state management for dynamic aeronautical information.</p>
	]]></content:encoded>

	<dc:title>BiTE: A Bitemporal Event-Centered Database Framework for Dynamic Aeronautical Information State Management</dc:title>
			<dc:creator>Tianyue Wei</dc:creator>
			<dc:creator>Xin Lai</dc:creator>
			<dc:creator>Yidan Liang</dc:creator>
			<dc:creator>Chengwei Zhang</dc:creator>
			<dc:creator>Rui Kang</dc:creator>
		<dc:identifier>doi: 10.3390/info17070710</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>710</prism:startingPage>
		<prism:doi>10.3390/info17070710</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/710</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/709">

	<title>Information, Vol. 17, Pages 709: Not Just Happy or Sad: An Exploratory Study on How Fine-Grained Emotions Relate to Linguistic Creativity in Improvised Speech</title>
	<link>https://www.mdpi.com/2078-2489/17/7/709</link>
	<description>Research on creativity often treats emotions using broad categories such as positive versus negative affect, which obscure the role of specific emotional states in creative performance. This exploratory study examines how fine-grained emotions relate to linguistic creativity in improvised speech. Thirty adult participants completed speech tasks across happy, neutral, and sad conditions, producing 90 speech samples. The responses were transcribed and evaluated using TTCT-inspired creativity dimensions: fluency, flexibility, originality, and elaboration. Fine-grained emotional states were estimated from the transcripts using automatic emotion recognition, and their associations with creativity scores were examined through statistical analysis. The findings suggest that linguistic creativity in improvised speech can be better understood by considering specific emotional profiles rather than relying only on broad positive or negative affect categories. The study contributes an exploratory methodological framework for future research on affect-aware creativity support systems and Computational models of emotion&amp;amp;ndash;creativity interaction.</description>
	<pubDate>2026-07-22</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 709: Not Just Happy or Sad: An Exploratory Study on How Fine-Grained Emotions Relate to Linguistic Creativity in Improvised Speech</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/709">doi: 10.3390/info17070709</a></p>
	<p>Authors:
		Sepideh Kalateh
		Nastaran Farhadighalati
		Sanaz Nikghadam-Hojjati
		Jose Barata
		</p>
	<p>Research on creativity often treats emotions using broad categories such as positive versus negative affect, which obscure the role of specific emotional states in creative performance. This exploratory study examines how fine-grained emotions relate to linguistic creativity in improvised speech. Thirty adult participants completed speech tasks across happy, neutral, and sad conditions, producing 90 speech samples. The responses were transcribed and evaluated using TTCT-inspired creativity dimensions: fluency, flexibility, originality, and elaboration. Fine-grained emotional states were estimated from the transcripts using automatic emotion recognition, and their associations with creativity scores were examined through statistical analysis. The findings suggest that linguistic creativity in improvised speech can be better understood by considering specific emotional profiles rather than relying only on broad positive or negative affect categories. The study contributes an exploratory methodological framework for future research on affect-aware creativity support systems and Computational models of emotion&amp;amp;ndash;creativity interaction.</p>
	]]></content:encoded>

	<dc:title>Not Just Happy or Sad: An Exploratory Study on How Fine-Grained Emotions Relate to Linguistic Creativity in Improvised Speech</dc:title>
			<dc:creator>Sepideh Kalateh</dc:creator>
			<dc:creator>Nastaran Farhadighalati</dc:creator>
			<dc:creator>Sanaz Nikghadam-Hojjati</dc:creator>
			<dc:creator>Jose Barata</dc:creator>
		<dc:identifier>doi: 10.3390/info17070709</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-22</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-22</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>709</prism:startingPage>
		<prism:doi>10.3390/info17070709</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/709</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/708">

	<title>Information, Vol. 17, Pages 708: EvoPlay-MuZero Hybrid Framework Incorporating a Dual-Peptide Bridging Strategy for Adjunctive Therapy in Alzheimer&amp;rsquo;s Disease</title>
	<link>https://www.mdpi.com/2078-2489/17/7/708</link>
	<description>Alzheimer&amp;amp;rsquo;s disease (AD) is a severe neurodegenerative disorder whose pathological progression is closely associated with the reduced binding affinity of apolipoprotein E &amp;amp;epsilon;4 (ApoE4) for amyloid-&amp;amp;beta; (A&amp;amp;beta;), which impairs A&amp;amp;beta; clearance. Existing computational molecular design approaches are largely limited to single-target optimization and therefore lack the capacity for synergistic dual-target modulation. Herein, we proposed EvoPlay-MuZero, a hybrid computational framework incorporating a dual-peptide bridging (DPB) strategy. The framework adopted latent-state planning in MuZero reinforcement learning to enhance exploration and sequence-generation efficiency in high-dimensional sequence spaces. For the first time, it enabled the automated design of bispecific peptides targeting ApoE4 and A&amp;amp;beta;, thereby forming a synergistic molecular bridge via a flexible linker. A full-process pipeline for structural and energetic evaluation was established by integrating AlphaFold3 and PDBePISA. Benchmark experiments on the 1SSC, 2CNZ, and 3R7G datasets demonstrated that EvoPlay-MuZero substantially outperformed the vanilla EvoPlay in convergence speed and the yield of valid generated sequences. Specifically, the optimal DPB molecule (15 &amp;amp;times; 25-3A) achieved a calculated interfacial solvation energy score (&amp;amp;Delta;iG) of &amp;amp;minus;29.5 kcal/mol, demonstrating substantially enhanced interface-stabilization properties compared to the native baseline control. This study provides a novel molecular intervention strategy for adjuvant therapy in AD and highlights the considerable potential of reinforcement learning in multi-target drug design.</description>
	<pubDate>2026-07-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 708: EvoPlay-MuZero Hybrid Framework Incorporating a Dual-Peptide Bridging Strategy for Adjunctive Therapy in Alzheimer&amp;rsquo;s Disease</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/708">doi: 10.3390/info17070708</a></p>
	<p>Authors:
		Bingling Huang
		Jiahao Li
		Ziyu Li
		Hao Jiang
		Mingxiang Yang
		Xiaoxia Li
		Xiaohui Niu
		</p>
	<p>Alzheimer&amp;amp;rsquo;s disease (AD) is a severe neurodegenerative disorder whose pathological progression is closely associated with the reduced binding affinity of apolipoprotein E &amp;amp;epsilon;4 (ApoE4) for amyloid-&amp;amp;beta; (A&amp;amp;beta;), which impairs A&amp;amp;beta; clearance. Existing computational molecular design approaches are largely limited to single-target optimization and therefore lack the capacity for synergistic dual-target modulation. Herein, we proposed EvoPlay-MuZero, a hybrid computational framework incorporating a dual-peptide bridging (DPB) strategy. The framework adopted latent-state planning in MuZero reinforcement learning to enhance exploration and sequence-generation efficiency in high-dimensional sequence spaces. For the first time, it enabled the automated design of bispecific peptides targeting ApoE4 and A&amp;amp;beta;, thereby forming a synergistic molecular bridge via a flexible linker. A full-process pipeline for structural and energetic evaluation was established by integrating AlphaFold3 and PDBePISA. Benchmark experiments on the 1SSC, 2CNZ, and 3R7G datasets demonstrated that EvoPlay-MuZero substantially outperformed the vanilla EvoPlay in convergence speed and the yield of valid generated sequences. Specifically, the optimal DPB molecule (15 &amp;amp;times; 25-3A) achieved a calculated interfacial solvation energy score (&amp;amp;Delta;iG) of &amp;amp;minus;29.5 kcal/mol, demonstrating substantially enhanced interface-stabilization properties compared to the native baseline control. This study provides a novel molecular intervention strategy for adjuvant therapy in AD and highlights the considerable potential of reinforcement learning in multi-target drug design.</p>
	]]></content:encoded>

	<dc:title>EvoPlay-MuZero Hybrid Framework Incorporating a Dual-Peptide Bridging Strategy for Adjunctive Therapy in Alzheimer&amp;amp;rsquo;s Disease</dc:title>
			<dc:creator>Bingling Huang</dc:creator>
			<dc:creator>Jiahao Li</dc:creator>
			<dc:creator>Ziyu Li</dc:creator>
			<dc:creator>Hao Jiang</dc:creator>
			<dc:creator>Mingxiang Yang</dc:creator>
			<dc:creator>Xiaoxia Li</dc:creator>
			<dc:creator>Xiaohui Niu</dc:creator>
		<dc:identifier>doi: 10.3390/info17070708</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>708</prism:startingPage>
		<prism:doi>10.3390/info17070708</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/708</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/707">

	<title>Information, Vol. 17, Pages 707: Tourism Hotel Recommendation Model Based on ISTING-AGNES Machine Learning and IDFST Optimal Route Algorithm</title>
	<link>https://www.mdpi.com/2078-2489/17/7/707</link>
	<description>To address the problem that hotel recommendations in tourism activities do not consider the spatial relationship between hotels and scenic spots and the cost of tour routes, we construct a tourism hotel recommendation model based on ISTING-AGNES machine learning and an IDFST optimal route algorithm. Firstly, a scenic spot spatial clustering model based on the ISTING-AGNES machine learning algorithm is constructed, including a scenic spot ISG spatial topological model based on the neighborhood cell growth algorithm and an ISTING-AGNES machine learning algorithm based on the scenic spot ISG spatial topological model, which can realize spatial dimension reduction in tourist cities and construct tourism sub-regions for recommending scenic spots and hotels. Secondly, taking the tourism sub-regions as the modeling scope, a tourism hotel recommendation model based on the IDFST optimal route algorithm is constructed in which a closeness model between the tourists&amp;amp;rsquo; interests and the attributes of scenic spots in the sub-region is established to recommend the most matched scenic spots for tourists. Then, based on the recommended scenic spots, a tourism sub-interval optimal route algorithm based on IDFST and a tourism hotel recommendation model based on the optimal route decision forest algorithm are established to search for the global optimal tour route&amp;amp;mdash;with hotels as the starting and ending points and scenic spots as nodes&amp;amp;mdash;and to recommend the hotel with the most cost-effective tour route for tourists. The experiments prove that the constructed algorithm can output the hotel with the best geospatial location and the lowest tour route cost. Under the experimental conditions, compared with the hotel recommended by the weighted centroid positioning algorithm, the cost optimization rate reaches 5.98%. Compared with the greedy mountain climbing algorithm and the greedy BFS algorithm, the cost optimization rates reach 14.73% and 16.03%, proving that the constructed algorithm is feasible and advantageous over the traditional algorithms.</description>
	<pubDate>2026-07-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 707: Tourism Hotel Recommendation Model Based on ISTING-AGNES Machine Learning and IDFST Optimal Route Algorithm</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/707">doi: 10.3390/info17070707</a></p>
	<p>Authors:
		Xiao Zhou
		Wenbing Liu
		Jun Wang
		Yilong Han
		</p>
	<p>To address the problem that hotel recommendations in tourism activities do not consider the spatial relationship between hotels and scenic spots and the cost of tour routes, we construct a tourism hotel recommendation model based on ISTING-AGNES machine learning and an IDFST optimal route algorithm. Firstly, a scenic spot spatial clustering model based on the ISTING-AGNES machine learning algorithm is constructed, including a scenic spot ISG spatial topological model based on the neighborhood cell growth algorithm and an ISTING-AGNES machine learning algorithm based on the scenic spot ISG spatial topological model, which can realize spatial dimension reduction in tourist cities and construct tourism sub-regions for recommending scenic spots and hotels. Secondly, taking the tourism sub-regions as the modeling scope, a tourism hotel recommendation model based on the IDFST optimal route algorithm is constructed in which a closeness model between the tourists&amp;amp;rsquo; interests and the attributes of scenic spots in the sub-region is established to recommend the most matched scenic spots for tourists. Then, based on the recommended scenic spots, a tourism sub-interval optimal route algorithm based on IDFST and a tourism hotel recommendation model based on the optimal route decision forest algorithm are established to search for the global optimal tour route&amp;amp;mdash;with hotels as the starting and ending points and scenic spots as nodes&amp;amp;mdash;and to recommend the hotel with the most cost-effective tour route for tourists. The experiments prove that the constructed algorithm can output the hotel with the best geospatial location and the lowest tour route cost. Under the experimental conditions, compared with the hotel recommended by the weighted centroid positioning algorithm, the cost optimization rate reaches 5.98%. Compared with the greedy mountain climbing algorithm and the greedy BFS algorithm, the cost optimization rates reach 14.73% and 16.03%, proving that the constructed algorithm is feasible and advantageous over the traditional algorithms.</p>
	]]></content:encoded>

	<dc:title>Tourism Hotel Recommendation Model Based on ISTING-AGNES Machine Learning and IDFST Optimal Route Algorithm</dc:title>
			<dc:creator>Xiao Zhou</dc:creator>
			<dc:creator>Wenbing Liu</dc:creator>
			<dc:creator>Jun Wang</dc:creator>
			<dc:creator>Yilong Han</dc:creator>
		<dc:identifier>doi: 10.3390/info17070707</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>707</prism:startingPage>
		<prism:doi>10.3390/info17070707</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/707</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/706">

	<title>Information, Vol. 17, Pages 706: The Socratic Trap: Benchmarking the Capacity of Large Language Models to Generate Strategic Misconceptions in Computer Science Education</title>
	<link>https://www.mdpi.com/2078-2489/17/7/706</link>
	<description>Large language models (LLMs) are increasingly integrated into educational settings, yet their pedagogical reliability remains insufficiently understood. Beyond overt hallucinations, which informed users readily recognize, a subtler failure mode consists of explanations that are coherent, authoritative, and pedagogically plausible while harbouring hidden conceptual flaws, responses we term Socratic traps. This paper introduces SocraticTrap-CS, a publicly available benchmark that probes the capacity of open-weight LLMs to generate such strategic misconceptions on demand. A single structured prompt explicitly elicited three outputs per concept (a correct explanation, an overt hallucination, and a strategic misconception), yielding 735 expert-annotated response segments from seven open-weight models across 35 core concepts in algorithms and data structures, programming languages and paradigms, databases, computer networks, and operating systems. Three domain experts independently annotated each segment using a three-class schema, achieving near-perfect agreement (Fleiss&amp;amp;rsquo; &amp;amp;kappa;=0.9487). Because models were explicitly instructed to produce the misconception, the central metric quantifies adversarial instruction-following capacity rather than the base rate of such errors in naturalistic use and should be read as a conservative upper bound on model capability. Under these conditions, compliance reached 91.7% overall (100% for three models; 57.1% for the smallest model, Mistral 7B, whose lower rate plausibly reflects weaker instruction-following rather than greater safety). Expert-judged persuasiveness was moderate to high, errors were predominantly conceptual rather than factual, models differed significantly, and no statistically significant domain-level differences were detected. The benchmark reframes the evaluation of educational LLMs around pedagogical trustworthiness rather than factual correctness alone.</description>
	<pubDate>2026-07-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 706: The Socratic Trap: Benchmarking the Capacity of Large Language Models to Generate Strategic Misconceptions in Computer Science Education</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/706">doi: 10.3390/info17070706</a></p>
	<p>Authors:
		Marijela Miličević
		Mia Rovis
		Ratomir Karlović
		Sandi Baressi Šegota
		Vedran Mrzljak
		Ivan Lorencin
		Darko Etinger
		</p>
	<p>Large language models (LLMs) are increasingly integrated into educational settings, yet their pedagogical reliability remains insufficiently understood. Beyond overt hallucinations, which informed users readily recognize, a subtler failure mode consists of explanations that are coherent, authoritative, and pedagogically plausible while harbouring hidden conceptual flaws, responses we term Socratic traps. This paper introduces SocraticTrap-CS, a publicly available benchmark that probes the capacity of open-weight LLMs to generate such strategic misconceptions on demand. A single structured prompt explicitly elicited three outputs per concept (a correct explanation, an overt hallucination, and a strategic misconception), yielding 735 expert-annotated response segments from seven open-weight models across 35 core concepts in algorithms and data structures, programming languages and paradigms, databases, computer networks, and operating systems. Three domain experts independently annotated each segment using a three-class schema, achieving near-perfect agreement (Fleiss&amp;amp;rsquo; &amp;amp;kappa;=0.9487). Because models were explicitly instructed to produce the misconception, the central metric quantifies adversarial instruction-following capacity rather than the base rate of such errors in naturalistic use and should be read as a conservative upper bound on model capability. Under these conditions, compliance reached 91.7% overall (100% for three models; 57.1% for the smallest model, Mistral 7B, whose lower rate plausibly reflects weaker instruction-following rather than greater safety). Expert-judged persuasiveness was moderate to high, errors were predominantly conceptual rather than factual, models differed significantly, and no statistically significant domain-level differences were detected. The benchmark reframes the evaluation of educational LLMs around pedagogical trustworthiness rather than factual correctness alone.</p>
	]]></content:encoded>

	<dc:title>The Socratic Trap: Benchmarking the Capacity of Large Language Models to Generate Strategic Misconceptions in Computer Science Education</dc:title>
			<dc:creator>Marijela Miličević</dc:creator>
			<dc:creator>Mia Rovis</dc:creator>
			<dc:creator>Ratomir Karlović</dc:creator>
			<dc:creator>Sandi Baressi Šegota</dc:creator>
			<dc:creator>Vedran Mrzljak</dc:creator>
			<dc:creator>Ivan Lorencin</dc:creator>
			<dc:creator>Darko Etinger</dc:creator>
		<dc:identifier>doi: 10.3390/info17070706</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>706</prism:startingPage>
		<prism:doi>10.3390/info17070706</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/706</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/705">

	<title>Information, Vol. 17, Pages 705: UAV RF Signal Azimuth Estimation Using a UCA-8 and a Dual-Branch Circular-Regression Network</title>
	<link>https://www.mdpi.com/2078-2489/17/7/705</link>
	<description>To address the problems that existing UAV RF signal azimuth estimation methods rely on idealized simulation data and lack accuracy and robustness in complex environments, a high-precision azimuth estimation method based on an improved ResNet, namely the Dual-Branch Circular-Regression Network, is proposed. Firstly, UCA-8 array data is generated from measured single-channel RF signals, and non-ideal factors such as channel mismatch and mutual coupling among array elements are incorporated to simulate the real RF receiving environment. Secondly, ResNet is improved from three aspects: input normalization, dynamic dual-branch (DDB) learning features and periodic angle regression. The input normalization strategy based on Per-Sample Complex Root Mean Square (PSCRMS) is adopted to improve the adaptability of the model to signal scale changes. The DDB structure is adopted to adaptively fuse I/Q spatiotemporal features with a spatial covariance statistical prior to enhance the spatial feature expression ability in complex scenes. A periodic angle regression method based on Unit Circular Vector Representation (UCVR) and the Huber Loss (GAH Loss) of geodesic angle distance is adopted to realize periodic angle continuous modeling and suppress abnormal angle errors. Finally, comparative and ablation experiments are conducted on the constructed UCA-8 dataset. The experimental results show that compared with the baseline ResNet, the Dual-Branch Circular-Regression Network achieves 85.8%, 95.3%, and 81.5% reductions in MAE, RMSE and P95, respectively, and maintains higher estimation accuracy and good robustness under low signal-to-noise ratio, hardware mismatch and co-frequency dual-source interference.</description>
	<pubDate>2026-07-21</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 705: UAV RF Signal Azimuth Estimation Using a UCA-8 and a Dual-Branch Circular-Regression Network</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/705">doi: 10.3390/info17070705</a></p>
	<p>Authors:
		Jingyang Wang
		Jie Ma
		Jiaxi Zhang
		Zehan Li
		Min Huang
		</p>
	<p>To address the problems that existing UAV RF signal azimuth estimation methods rely on idealized simulation data and lack accuracy and robustness in complex environments, a high-precision azimuth estimation method based on an improved ResNet, namely the Dual-Branch Circular-Regression Network, is proposed. Firstly, UCA-8 array data is generated from measured single-channel RF signals, and non-ideal factors such as channel mismatch and mutual coupling among array elements are incorporated to simulate the real RF receiving environment. Secondly, ResNet is improved from three aspects: input normalization, dynamic dual-branch (DDB) learning features and periodic angle regression. The input normalization strategy based on Per-Sample Complex Root Mean Square (PSCRMS) is adopted to improve the adaptability of the model to signal scale changes. The DDB structure is adopted to adaptively fuse I/Q spatiotemporal features with a spatial covariance statistical prior to enhance the spatial feature expression ability in complex scenes. A periodic angle regression method based on Unit Circular Vector Representation (UCVR) and the Huber Loss (GAH Loss) of geodesic angle distance is adopted to realize periodic angle continuous modeling and suppress abnormal angle errors. Finally, comparative and ablation experiments are conducted on the constructed UCA-8 dataset. The experimental results show that compared with the baseline ResNet, the Dual-Branch Circular-Regression Network achieves 85.8%, 95.3%, and 81.5% reductions in MAE, RMSE and P95, respectively, and maintains higher estimation accuracy and good robustness under low signal-to-noise ratio, hardware mismatch and co-frequency dual-source interference.</p>
	]]></content:encoded>

	<dc:title>UAV RF Signal Azimuth Estimation Using a UCA-8 and a Dual-Branch Circular-Regression Network</dc:title>
			<dc:creator>Jingyang Wang</dc:creator>
			<dc:creator>Jie Ma</dc:creator>
			<dc:creator>Jiaxi Zhang</dc:creator>
			<dc:creator>Zehan Li</dc:creator>
			<dc:creator>Min Huang</dc:creator>
		<dc:identifier>doi: 10.3390/info17070705</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-21</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-21</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>705</prism:startingPage>
		<prism:doi>10.3390/info17070705</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/705</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/704">

	<title>Information, Vol. 17, Pages 704: Coverage Formation Control of Multi-Rover System for Large-Scale Planetary Exploration Under Localization Uncertainty Based on Guaranteed Voronoi and Belief Space Planning</title>
	<link>https://www.mdpi.com/2078-2489/17/7/704</link>
	<description>This work addresses coverage formation control for the Multi-Rover System (MRS) in extraplanetary environments such as Mars or the Moon, where Global Navigation Satellite System (GNSS) signals are unavailable and uncertain self-localization significantly degrades coverage performance. Existing coverage strategies predominantly assume perfect localization, which is unrealistic for GNSS-denied planetary surfaces. This paper presents a novel multi-rover coverage formation control algorithm that combines guaranteed Voronoi partitioning with belief space planning. The core contributions are (i) a guaranteed Voronoi partitioning framework that provides deterministic bounds on true coverage cells under localization uncertainty; (ii) a dual-layer optimization architecture integrating Extended Kalman Filter-based self-localization with centroid-error minimization; and (iii) a belief space planning approach that predicts system state evolution and infers optimal control inputs over a receding horizon. Simulation results under multiple density distributions and rover configurations demonstrate faster convergence and lower coverage cost compared to conventional Lloyd-based methods. By extending existing coverage strategies, our approach supports rapid and adaptive deployment of multi-rover networks in GNSS-limited environments, providing a promising solution for large-scale planetary exploration.</description>
	<pubDate>2026-07-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 704: Coverage Formation Control of Multi-Rover System for Large-Scale Planetary Exploration Under Localization Uncertainty Based on Guaranteed Voronoi and Belief Space Planning</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/704">doi: 10.3390/info17070704</a></p>
	<p>Authors:
		Yanping Chen
		Junjie Zhang
		Chi Zhang
		</p>
	<p>This work addresses coverage formation control for the Multi-Rover System (MRS) in extraplanetary environments such as Mars or the Moon, where Global Navigation Satellite System (GNSS) signals are unavailable and uncertain self-localization significantly degrades coverage performance. Existing coverage strategies predominantly assume perfect localization, which is unrealistic for GNSS-denied planetary surfaces. This paper presents a novel multi-rover coverage formation control algorithm that combines guaranteed Voronoi partitioning with belief space planning. The core contributions are (i) a guaranteed Voronoi partitioning framework that provides deterministic bounds on true coverage cells under localization uncertainty; (ii) a dual-layer optimization architecture integrating Extended Kalman Filter-based self-localization with centroid-error minimization; and (iii) a belief space planning approach that predicts system state evolution and infers optimal control inputs over a receding horizon. Simulation results under multiple density distributions and rover configurations demonstrate faster convergence and lower coverage cost compared to conventional Lloyd-based methods. By extending existing coverage strategies, our approach supports rapid and adaptive deployment of multi-rover networks in GNSS-limited environments, providing a promising solution for large-scale planetary exploration.</p>
	]]></content:encoded>

	<dc:title>Coverage Formation Control of Multi-Rover System for Large-Scale Planetary Exploration Under Localization Uncertainty Based on Guaranteed Voronoi and Belief Space Planning</dc:title>
			<dc:creator>Yanping Chen</dc:creator>
			<dc:creator>Junjie Zhang</dc:creator>
			<dc:creator>Chi Zhang</dc:creator>
		<dc:identifier>doi: 10.3390/info17070704</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>704</prism:startingPage>
		<prism:doi>10.3390/info17070704</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/704</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/703">

	<title>Information, Vol. 17, Pages 703: EEG-Based Classification of Alzheimer&amp;rsquo;s Disease and Frontotemporal Dementia via a Dynamic Threshold Graph Convolutional Network</title>
	<link>https://www.mdpi.com/2078-2489/17/7/703</link>
	<description>Accurate differentiation of Alzheimer&amp;amp;rsquo;s disease (AD) and frontotemporal dementia (FTD) is clinically important because their management strategies differ. This study aimed to develop and evaluate a Dynamic Threshold Graph Convolutional Network (DT-GCN) and to systematically compare four EEG-based functional connectivity (FC) measures&amp;amp;mdash;Pearson correlation, phase-locking value (PLV), Granger causality, and copula analysis&amp;amp;mdash;for classifying AD, FTD, and healthy controls (HCs). In contrast to fixed graph binarization, DT-GCN updates the connectivity threshold at each training epoch according to training-fold loss. The model is trained under a multi-task objective combining classification, reconstruction, and contrastive losses, with the loss weights adjusted across three stages of training. Resting-state 19-channel EEG recordings from a public dataset (DS004504) comprising 36 AD, 23 FTD, and 29 HC participants were segmented into non-overlapping 8 s epochs. FC estimates were aggregated to obtain a subject-level adjacency matrix for each measure, with one-hot node identity and node degree as node features. Classification was performed at the subject level using stratified five-fold cross-validation with normalization and hyperparameter selection confined to training folds. Under the broadband setting, copula-based FC with DT-GCN yielded the highest observed three-class accuracy of 0.82&amp;amp;plusmn;0.07 (macro-F1 0.79&amp;amp;plusmn;0.07), compared with 0.45&amp;amp;plusmn;0.06 accuracy and 0.36&amp;amp;plusmn;0.06 macro-F1 for the standard GCN baseline. However, the small single-center cohort (N=88, including 23 participants with FTD) and the resulting small test folds limit the precision of the performance estimates and preclude robust inferential comparisons among FC methods and classification scenarios. These exploratory, dataset-specific findings require independent external validation and should not be interpreted as generalizable clinical performance or validated clinical biomarkers.</description>
	<pubDate>2026-07-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 703: EEG-Based Classification of Alzheimer&amp;rsquo;s Disease and Frontotemporal Dementia via a Dynamic Threshold Graph Convolutional Network</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/703">doi: 10.3390/info17070703</a></p>
	<p>Authors:
		Yanzhi Liu
		Ming Meng
		</p>
	<p>Accurate differentiation of Alzheimer&amp;amp;rsquo;s disease (AD) and frontotemporal dementia (FTD) is clinically important because their management strategies differ. This study aimed to develop and evaluate a Dynamic Threshold Graph Convolutional Network (DT-GCN) and to systematically compare four EEG-based functional connectivity (FC) measures&amp;amp;mdash;Pearson correlation, phase-locking value (PLV), Granger causality, and copula analysis&amp;amp;mdash;for classifying AD, FTD, and healthy controls (HCs). In contrast to fixed graph binarization, DT-GCN updates the connectivity threshold at each training epoch according to training-fold loss. The model is trained under a multi-task objective combining classification, reconstruction, and contrastive losses, with the loss weights adjusted across three stages of training. Resting-state 19-channel EEG recordings from a public dataset (DS004504) comprising 36 AD, 23 FTD, and 29 HC participants were segmented into non-overlapping 8 s epochs. FC estimates were aggregated to obtain a subject-level adjacency matrix for each measure, with one-hot node identity and node degree as node features. Classification was performed at the subject level using stratified five-fold cross-validation with normalization and hyperparameter selection confined to training folds. Under the broadband setting, copula-based FC with DT-GCN yielded the highest observed three-class accuracy of 0.82&amp;amp;plusmn;0.07 (macro-F1 0.79&amp;amp;plusmn;0.07), compared with 0.45&amp;amp;plusmn;0.06 accuracy and 0.36&amp;amp;plusmn;0.06 macro-F1 for the standard GCN baseline. However, the small single-center cohort (N=88, including 23 participants with FTD) and the resulting small test folds limit the precision of the performance estimates and preclude robust inferential comparisons among FC methods and classification scenarios. These exploratory, dataset-specific findings require independent external validation and should not be interpreted as generalizable clinical performance or validated clinical biomarkers.</p>
	]]></content:encoded>

	<dc:title>EEG-Based Classification of Alzheimer&amp;amp;rsquo;s Disease and Frontotemporal Dementia via a Dynamic Threshold Graph Convolutional Network</dc:title>
			<dc:creator>Yanzhi Liu</dc:creator>
			<dc:creator>Ming Meng</dc:creator>
		<dc:identifier>doi: 10.3390/info17070703</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>703</prism:startingPage>
		<prism:doi>10.3390/info17070703</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/703</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/702">

	<title>Information, Vol. 17, Pages 702: A Leakage-Controlled, Calibration-First Evaluation of Machine Learning Models for Startup-Outcome Prediction: Evidence from Crunchbase</title>
	<link>https://www.mdpi.com/2078-2489/17/7/702</link>
	<description>Machine learning is increasingly used in entrepreneurship analytics to predict startup outcomes, frequently reporting accuracy above 0.90, yet whether such performance reflects a genuine ex-ante signal or methodological artifact remains unclear and consequential for investors, accelerators, and innovation-policy agencies. This study evaluates startup-outcome classification under a leakage-controlled, calibration-first protocol using two Crunchbase-derived datasets (66,368 firms; a 923-firm engineered-feature set), three success constructs, and three model families under five-fold stratified cross-validation. Removing outcome-correlated, survivorship-accumulating features lowers the area under the receiver operating characteristic curve by 0.05 to 0.09 on the large dataset, with every paired 95% confidence interval excluding zero, and by 0.19 on the engineered dataset; an independent study on the same 923-firm data without leakage control reports 88.1% accuracy. The leakage-controlled performance level is modest (0.66 to 0.77). Calibration rankings diverge from discrimination rankings: gradient boosting is well calibrated (expected calibration error of 0.006 to 0.024), whereas logistic regression shows large calibration error on imbalanced constructs (largely an artifact of class weighting rather than an intrinsic model property); post hoc isotonic recalibration then removes most of the error. The contribution is a reusable evaluation protocol for entrepreneurship analytics. Findings are associational and specific to the analyzed samples.</description>
	<pubDate>2026-07-20</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 702: A Leakage-Controlled, Calibration-First Evaluation of Machine Learning Models for Startup-Outcome Prediction: Evidence from Crunchbase</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/702">doi: 10.3390/info17070702</a></p>
	<p>Authors:
		Ratchaneekorn Khamphukun
		Warawut Narkbunnum
		</p>
	<p>Machine learning is increasingly used in entrepreneurship analytics to predict startup outcomes, frequently reporting accuracy above 0.90, yet whether such performance reflects a genuine ex-ante signal or methodological artifact remains unclear and consequential for investors, accelerators, and innovation-policy agencies. This study evaluates startup-outcome classification under a leakage-controlled, calibration-first protocol using two Crunchbase-derived datasets (66,368 firms; a 923-firm engineered-feature set), three success constructs, and three model families under five-fold stratified cross-validation. Removing outcome-correlated, survivorship-accumulating features lowers the area under the receiver operating characteristic curve by 0.05 to 0.09 on the large dataset, with every paired 95% confidence interval excluding zero, and by 0.19 on the engineered dataset; an independent study on the same 923-firm data without leakage control reports 88.1% accuracy. The leakage-controlled performance level is modest (0.66 to 0.77). Calibration rankings diverge from discrimination rankings: gradient boosting is well calibrated (expected calibration error of 0.006 to 0.024), whereas logistic regression shows large calibration error on imbalanced constructs (largely an artifact of class weighting rather than an intrinsic model property); post hoc isotonic recalibration then removes most of the error. The contribution is a reusable evaluation protocol for entrepreneurship analytics. Findings are associational and specific to the analyzed samples.</p>
	]]></content:encoded>

	<dc:title>A Leakage-Controlled, Calibration-First Evaluation of Machine Learning Models for Startup-Outcome Prediction: Evidence from Crunchbase</dc:title>
			<dc:creator>Ratchaneekorn Khamphukun</dc:creator>
			<dc:creator>Warawut Narkbunnum</dc:creator>
		<dc:identifier>doi: 10.3390/info17070702</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-20</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-20</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>702</prism:startingPage>
		<prism:doi>10.3390/info17070702</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/702</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/701">

	<title>Information, Vol. 17, Pages 701: A Rolling Bearing Fault Diagnosis Method Based on ICEEMDAN and AHO&amp;minus;SVM</title>
	<link>https://www.mdpi.com/2078-2489/17/7/701</link>
	<description>To address the issues of rolling bearing fault vibration signals being susceptible to noise interference and the support vector machine (SVM) relying on manual parameter settings, this paper proposes a fault diagnosis method based on ICEEMDAN and AIHO&amp;amp;minus;SVM. Firstly, the Hippopotamus Optimization Algorithm is improved by incorporating Chebyshev chaotic mapping, refraction opposite learning, dynamic weighting, adaptive step size, and guided learning strategies, thereby enhancing convergence accuracy and speed. Secondly, ICEEMDAN is employed to decompose vibration signals for noise reduction, and the effective intrinsic mode function (IMF) components are selected according to the mutual information criterion to reconstruct the signal. Nine time&amp;amp;minus;domain statistical features are then extracted to construct the fault feature vector. Thirdly, AIHO is used to collaboratively optimize the penalty factor and kernel parameters of SVM, establishing an AIHO&amp;amp;minus;SVM classification model. Finally, the proposed method is validated on bearing datasets from Case Western Reserve University and Huazhong University of Science and Technology. Experimental results show that the average diagnostic accuracies on the two datasets reach 99.07% and 99.09%, respectively, demonstrating the effectiveness of the proposed method for rolling bearing fault diagnosis.</description>
	<pubDate>2026-07-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 701: A Rolling Bearing Fault Diagnosis Method Based on ICEEMDAN and AHO&amp;minus;SVM</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/701">doi: 10.3390/info17070701</a></p>
	<p>Authors:
		Liping Wang
		Yaozheng Zhao
		Yan Chen
		Guangyong Xi
		</p>
	<p>To address the issues of rolling bearing fault vibration signals being susceptible to noise interference and the support vector machine (SVM) relying on manual parameter settings, this paper proposes a fault diagnosis method based on ICEEMDAN and AIHO&amp;amp;minus;SVM. Firstly, the Hippopotamus Optimization Algorithm is improved by incorporating Chebyshev chaotic mapping, refraction opposite learning, dynamic weighting, adaptive step size, and guided learning strategies, thereby enhancing convergence accuracy and speed. Secondly, ICEEMDAN is employed to decompose vibration signals for noise reduction, and the effective intrinsic mode function (IMF) components are selected according to the mutual information criterion to reconstruct the signal. Nine time&amp;amp;minus;domain statistical features are then extracted to construct the fault feature vector. Thirdly, AIHO is used to collaboratively optimize the penalty factor and kernel parameters of SVM, establishing an AIHO&amp;amp;minus;SVM classification model. Finally, the proposed method is validated on bearing datasets from Case Western Reserve University and Huazhong University of Science and Technology. Experimental results show that the average diagnostic accuracies on the two datasets reach 99.07% and 99.09%, respectively, demonstrating the effectiveness of the proposed method for rolling bearing fault diagnosis.</p>
	]]></content:encoded>

	<dc:title>A Rolling Bearing Fault Diagnosis Method Based on ICEEMDAN and AHO&amp;amp;minus;SVM</dc:title>
			<dc:creator>Liping Wang</dc:creator>
			<dc:creator>Yaozheng Zhao</dc:creator>
			<dc:creator>Yan Chen</dc:creator>
			<dc:creator>Guangyong Xi</dc:creator>
		<dc:identifier>doi: 10.3390/info17070701</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-19</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-19</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>701</prism:startingPage>
		<prism:doi>10.3390/info17070701</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/701</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/700">

	<title>Information, Vol. 17, Pages 700: Detecting Latent Social Psychological Constructs in Russia Ukraine War Discourse: A Probabilistic and Temporally Validated Analysis of 48,201 Tweets</title>
	<link>https://www.mdpi.com/2078-2489/17/7/700</link>
	<description>Despite advances in computational social science, online conflict discourse is still commonly analyzed through sentiment, stance, or topic models, leaving limited insight into the social and psychological mechanisms embedded in digital war narratives. This study develops a theory-informed probabilistic framework for detecting discourse-level indicators of Social Identity Theory, Moral Foundations Theory, Threat Appraisal, Cognitive Distortion, and Deindividuation in Russia&amp;amp;ndash;Ukraine war discourse. The empirical design uses 48,201 tweets in total: 10,815 tweets collected between 1 January and 28 June 2022 for model development and primary analysis, as well as and an external validation corpus of 37,386 Russia&amp;amp;ndash;Ukraine cyberwar-related tweets&amp;amp;mdash;collected from 30,706 users across 54 languages between October 2022 and April 2023&amp;amp;mdash;for temporal robustness assessment. The primary corpus contained 10,815 unique tweet identifiers, 10,229 unique textual records, 586 repeated textual items, a textual uniqueness rate of 94.58%, 6646 English tweets (61.45%), and 32,260 retweet engagements. Methodologically, the framework combines contextual language representations, theory-aligned linguistic cues, temporal signals, engagement features, and graph-based indicators. These signals are used to infer latent constructs and are evaluated through calibration, ablation testing, human validation, and cascade comparison. Empirically, Deindividuation was the dominant construct (1654 posts, 15.29%), followed by Cognitive Distortion (525, 4.85%) and Threat Appraisal (503, 4.65%). Co-activation analysis showed the strongest overlap between Deindividuation and Cognitive Distortion (Jaccard = 0.26). Validation diagnostics indicated internal lexical consistency (r=0.88 for Deindividuation), 93% rumor calibration, 91% bootstrap stability, and improved baseline performance (F1 = 0.72; Brier = 0.12; cascade log-likelihood = &amp;amp;minus;865). The findings demonstrate that theoretically grounded probabilistic modeling can provide scalable, interpretable, and temporally validated insight into psychological patterns in digital conflict discourse.</description>
	<pubDate>2026-07-19</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 700: Detecting Latent Social Psychological Constructs in Russia Ukraine War Discourse: A Probabilistic and Temporally Validated Analysis of 48,201 Tweets</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/700">doi: 10.3390/info17070700</a></p>
	<p>Authors:
		Fahim Sufi
		Fatematuz Zohra
		</p>
	<p>Despite advances in computational social science, online conflict discourse is still commonly analyzed through sentiment, stance, or topic models, leaving limited insight into the social and psychological mechanisms embedded in digital war narratives. This study develops a theory-informed probabilistic framework for detecting discourse-level indicators of Social Identity Theory, Moral Foundations Theory, Threat Appraisal, Cognitive Distortion, and Deindividuation in Russia&amp;amp;ndash;Ukraine war discourse. The empirical design uses 48,201 tweets in total: 10,815 tweets collected between 1 January and 28 June 2022 for model development and primary analysis, as well as and an external validation corpus of 37,386 Russia&amp;amp;ndash;Ukraine cyberwar-related tweets&amp;amp;mdash;collected from 30,706 users across 54 languages between October 2022 and April 2023&amp;amp;mdash;for temporal robustness assessment. The primary corpus contained 10,815 unique tweet identifiers, 10,229 unique textual records, 586 repeated textual items, a textual uniqueness rate of 94.58%, 6646 English tweets (61.45%), and 32,260 retweet engagements. Methodologically, the framework combines contextual language representations, theory-aligned linguistic cues, temporal signals, engagement features, and graph-based indicators. These signals are used to infer latent constructs and are evaluated through calibration, ablation testing, human validation, and cascade comparison. Empirically, Deindividuation was the dominant construct (1654 posts, 15.29%), followed by Cognitive Distortion (525, 4.85%) and Threat Appraisal (503, 4.65%). Co-activation analysis showed the strongest overlap between Deindividuation and Cognitive Distortion (Jaccard = 0.26). Validation diagnostics indicated internal lexical consistency (r=0.88 for Deindividuation), 93% rumor calibration, 91% bootstrap stability, and improved baseline performance (F1 = 0.72; Brier = 0.12; cascade log-likelihood = &amp;amp;minus;865). The findings demonstrate that theoretically grounded probabilistic modeling can provide scalable, interpretable, and temporally validated insight into psychological patterns in digital conflict discourse.</p>
	]]></content:encoded>

	<dc:title>Detecting Latent Social Psychological Constructs in Russia Ukraine War Discourse: A Probabilistic and Temporally Validated Analysis of 48,201 Tweets</dc:title>
			<dc:creator>Fahim Sufi</dc:creator>
			<dc:creator>Fatematuz Zohra</dc:creator>
		<dc:identifier>doi: 10.3390/info17070700</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-19</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-19</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>700</prism:startingPage>
		<prism:doi>10.3390/info17070700</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/700</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/699">

	<title>Information, Vol. 17, Pages 699: Short-Term Wind Power Forecasting via Multimodal Adaptive Graph Neural Networks with Credibility-Modulated Aggregation</title>
	<link>https://www.mdpi.com/2078-2489/17/7/699</link>
	<description>Wind power forecasting plays a crucial role in power dispatch and safety management of wind farms. However, the insufficient integration of multimodal heterogeneous data and the limitations of conventional graph construction strategies significantly restrict forecasting performance. Existing approaches either rely on simple feature aggregation, which cannot fully capture cross-modal dependencies, or adopt predefined or single-criterion graph construction methods that fail to characterize complex turbine relationships involving spatial, temporal, and nonlinear correlations. To address these challenges, this paper proposes a Multimodal Adaptive Fusion Graph Neural Network (MAF-GNN) for short-term wind power forecasting. First, a Modality-Aware Representation Learning (MARL) module is developed to extract informative multimodal representations by modeling modality-specific characteristics and cross-modal dependencies through attention-based fusion. Second, an Adaptive Graph Learning with Multi-Similarity (AGL-MS) module is introduced to parametrically integrate four complementary similarity priors&amp;amp;mdash;geographic distance, Dynamic Time Warping (DTW), Maximal Information Coefficient (MIC), and cosine similarity&amp;amp;mdash;for adaptive turbine correlation graph construction. Furthermore, a Credibility-Modulated Graph Convolutional Network (CM-GCN) is developed to reduce the influence of unreliable node information during message propagation. Extensive experiments conducted on the SDWPF dataset demonstrate that MAF-GNN reduces MAE by 14.0&amp;amp;ndash;21.3% compared with sequential baselines and achieves 5.3&amp;amp;ndash;10.2% improvement over spatiotemporal graph-based models. Ablation studies further verify the complementary effectiveness of each proposed module in improving forecasting performance.</description>
	<pubDate>2026-07-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 699: Short-Term Wind Power Forecasting via Multimodal Adaptive Graph Neural Networks with Credibility-Modulated Aggregation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/699">doi: 10.3390/info17070699</a></p>
	<p>Authors:
		Guochen Zhang
		Qing Ye
		Xiaobo Li
		Zhe Song
		</p>
	<p>Wind power forecasting plays a crucial role in power dispatch and safety management of wind farms. However, the insufficient integration of multimodal heterogeneous data and the limitations of conventional graph construction strategies significantly restrict forecasting performance. Existing approaches either rely on simple feature aggregation, which cannot fully capture cross-modal dependencies, or adopt predefined or single-criterion graph construction methods that fail to characterize complex turbine relationships involving spatial, temporal, and nonlinear correlations. To address these challenges, this paper proposes a Multimodal Adaptive Fusion Graph Neural Network (MAF-GNN) for short-term wind power forecasting. First, a Modality-Aware Representation Learning (MARL) module is developed to extract informative multimodal representations by modeling modality-specific characteristics and cross-modal dependencies through attention-based fusion. Second, an Adaptive Graph Learning with Multi-Similarity (AGL-MS) module is introduced to parametrically integrate four complementary similarity priors&amp;amp;mdash;geographic distance, Dynamic Time Warping (DTW), Maximal Information Coefficient (MIC), and cosine similarity&amp;amp;mdash;for adaptive turbine correlation graph construction. Furthermore, a Credibility-Modulated Graph Convolutional Network (CM-GCN) is developed to reduce the influence of unreliable node information during message propagation. Extensive experiments conducted on the SDWPF dataset demonstrate that MAF-GNN reduces MAE by 14.0&amp;amp;ndash;21.3% compared with sequential baselines and achieves 5.3&amp;amp;ndash;10.2% improvement over spatiotemporal graph-based models. Ablation studies further verify the complementary effectiveness of each proposed module in improving forecasting performance.</p>
	]]></content:encoded>

	<dc:title>Short-Term Wind Power Forecasting via Multimodal Adaptive Graph Neural Networks with Credibility-Modulated Aggregation</dc:title>
			<dc:creator>Guochen Zhang</dc:creator>
			<dc:creator>Qing Ye</dc:creator>
			<dc:creator>Xiaobo Li</dc:creator>
			<dc:creator>Zhe Song</dc:creator>
		<dc:identifier>doi: 10.3390/info17070699</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-18</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-18</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>699</prism:startingPage>
		<prism:doi>10.3390/info17070699</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/699</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/698">

	<title>Information, Vol. 17, Pages 698: Comparative Performance of AI-Generated Fake News Detection Pipelines on Romanian News Content</title>
	<link>https://www.mdpi.com/2078-2489/17/7/698</link>
	<description>Fake news detection has become a major research topic at the intersection of artificial intelligence, data mining, and information security. In this paper, we evaluate the performance of English-trained algorithms on English translations of Romanian-sourced news articles, using a translation-mediated cross-domain evaluation design. The study is based on source code generated with the assistance of artificial intelligence systems for a set of machine learning and transformer-based models. The code was subsequently implemented in Google Colab. 2026, trained on international benchmark datasets, and tested on Romanian news content. This design allowed the rapid prototyping of multiple detection pipelines and the systematic observation of their behavior in a media environment different from that represented in the training corpora. The models were evaluated comparatively using standard classification metrics, including accuracy, precision, recall, and F1-score, complemented by additional indicators relevant to model robustness and practical usability. The experimental results revealed significant differences in performance across algorithms when applied to English translations of Romanian-language news content after training on international datasets. However, this study does not provide a direct comparison between model performance on the international benchmark datasets and the Romanian test corpus; therefore, the gap between the international training corpus and the Romanian-sourced test corpus is interpreted as an exploratory limitation and as a direction for future research. Based on these findings, we propose an empirical classification of the tested models according to their predictive effectiveness, their contextual robustness across linguistic environments, and their operational relevance as filtering tools for institutional monitoring. The results show that AI-assisted coding workflows can provide a viable starting point for reproducible misinformation research, but they also underline the limitations of directly transferring models trained on non-Romanian data to local media ecosystems. The study offers both a replicable evaluation framework and practical insights for institutions involved in strategic communication, public security, and the monitoring of information threats.</description>
	<pubDate>2026-07-18</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 698: Comparative Performance of AI-Generated Fake News Detection Pipelines on Romanian News Content</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/698">doi: 10.3390/info17070698</a></p>
	<p>Authors:
		Claudiu Coman
		Costel Marian Dalban
		Vlad Bătrânu-Pințea
		Georgiana Aron
		Lucian Marina
		</p>
	<p>Fake news detection has become a major research topic at the intersection of artificial intelligence, data mining, and information security. In this paper, we evaluate the performance of English-trained algorithms on English translations of Romanian-sourced news articles, using a translation-mediated cross-domain evaluation design. The study is based on source code generated with the assistance of artificial intelligence systems for a set of machine learning and transformer-based models. The code was subsequently implemented in Google Colab. 2026, trained on international benchmark datasets, and tested on Romanian news content. This design allowed the rapid prototyping of multiple detection pipelines and the systematic observation of their behavior in a media environment different from that represented in the training corpora. The models were evaluated comparatively using standard classification metrics, including accuracy, precision, recall, and F1-score, complemented by additional indicators relevant to model robustness and practical usability. The experimental results revealed significant differences in performance across algorithms when applied to English translations of Romanian-language news content after training on international datasets. However, this study does not provide a direct comparison between model performance on the international benchmark datasets and the Romanian test corpus; therefore, the gap between the international training corpus and the Romanian-sourced test corpus is interpreted as an exploratory limitation and as a direction for future research. Based on these findings, we propose an empirical classification of the tested models according to their predictive effectiveness, their contextual robustness across linguistic environments, and their operational relevance as filtering tools for institutional monitoring. The results show that AI-assisted coding workflows can provide a viable starting point for reproducible misinformation research, but they also underline the limitations of directly transferring models trained on non-Romanian data to local media ecosystems. The study offers both a replicable evaluation framework and practical insights for institutions involved in strategic communication, public security, and the monitoring of information threats.</p>
	]]></content:encoded>

	<dc:title>Comparative Performance of AI-Generated Fake News Detection Pipelines on Romanian News Content</dc:title>
			<dc:creator>Claudiu Coman</dc:creator>
			<dc:creator>Costel Marian Dalban</dc:creator>
			<dc:creator>Vlad Bătrânu-Pințea</dc:creator>
			<dc:creator>Georgiana Aron</dc:creator>
			<dc:creator>Lucian Marina</dc:creator>
		<dc:identifier>doi: 10.3390/info17070698</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-18</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-18</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>698</prism:startingPage>
		<prism:doi>10.3390/info17070698</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/698</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/697">

	<title>Information, Vol. 17, Pages 697: Constructing MIDA5: A Design Science Approach for a User-Centered Data Analytics Methodology for Business Process Improvement</title>
	<link>https://www.mdpi.com/2078-2489/17/7/697</link>
	<description>Data Analytics methodologies provide structured approaches for transforming organizational data into actionable knowledge. However, many existing methodologies emphasize technical activities while offering limited support for stakeholder participation, user-centered validation, and organizational adoption. This study presents the construction of MIDA5, a Data Analytics methodology for Business Process Improvement developed using the Design Science Research paradigm. The research combined a comparative analysis of existing Data Analytics methodologies with an empirical experimentation process conducted in an organizational environment. The experimentation involved the execution and analytical deconstruction of a previously implemented Data Analytics methodology to identify operational limitations, stakeholder-related challenges, and methodological gaps. The findings were synthesized into design requirements, methodological components, and design needs that guided the construction of MIDA5. The resulting artifact incorporates principles of Business Process Analytics, User-Centered Design, and User Engagement and Gamification Dynamics through a five-phase structure supported by activities, artifacts, and stakeholder validation procedures. The study contributes a traceable Design Science-based development process that connects empirical findings with design decisions and provides a methodological foundation for the complete methodological specification and empirical evaluation of MIDA5. Accordingly, this study focuses on artifact construction rather than on demonstrating the effectiveness of the resulting methodology.</description>
	<pubDate>2026-07-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 697: Constructing MIDA5: A Design Science Approach for a User-Centered Data Analytics Methodology for Business Process Improvement</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/697">doi: 10.3390/info17070697</a></p>
	<p>Authors:
		Boris Astudillo
		Marco Santórum
		Jose Aguilar
		Mayra Carrión-Toro
		Patricia Acosta-Vargas
		</p>
	<p>Data Analytics methodologies provide structured approaches for transforming organizational data into actionable knowledge. However, many existing methodologies emphasize technical activities while offering limited support for stakeholder participation, user-centered validation, and organizational adoption. This study presents the construction of MIDA5, a Data Analytics methodology for Business Process Improvement developed using the Design Science Research paradigm. The research combined a comparative analysis of existing Data Analytics methodologies with an empirical experimentation process conducted in an organizational environment. The experimentation involved the execution and analytical deconstruction of a previously implemented Data Analytics methodology to identify operational limitations, stakeholder-related challenges, and methodological gaps. The findings were synthesized into design requirements, methodological components, and design needs that guided the construction of MIDA5. The resulting artifact incorporates principles of Business Process Analytics, User-Centered Design, and User Engagement and Gamification Dynamics through a five-phase structure supported by activities, artifacts, and stakeholder validation procedures. The study contributes a traceable Design Science-based development process that connects empirical findings with design decisions and provides a methodological foundation for the complete methodological specification and empirical evaluation of MIDA5. Accordingly, this study focuses on artifact construction rather than on demonstrating the effectiveness of the resulting methodology.</p>
	]]></content:encoded>

	<dc:title>Constructing MIDA5: A Design Science Approach for a User-Centered Data Analytics Methodology for Business Process Improvement</dc:title>
			<dc:creator>Boris Astudillo</dc:creator>
			<dc:creator>Marco Santórum</dc:creator>
			<dc:creator>Jose Aguilar</dc:creator>
			<dc:creator>Mayra Carrión-Toro</dc:creator>
			<dc:creator>Patricia Acosta-Vargas</dc:creator>
		<dc:identifier>doi: 10.3390/info17070697</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-17</dc:date>

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

	<title>Information, Vol. 17, Pages 696: Beyond Occam&amp;rsquo;s Razor: Double Descent and the Potential Paradigm Shift Toward Over-Parameterized Personalization in Higher Education</title>
	<link>https://www.mdpi.com/2078-2489/17/7/696</link>
	<description>This paper examines how the emergence of over-parameterized artificial intelligence models and the phenomenon of double descent challenge the classical assumption that simpler models generalize better. Traditional predictive analytics relied on parsimonious models grounded in the bias-variance trade-off, where increasing complexity was expected to produce overfitting. However, recent advances in deep learning demonstrate that highly over-parameterized models can achieve superior generalization after surpassing the interpolation threshold. This paradigm shift has enabled systems such as AlphaFold, Aurora, Delphi-2M, and recommenders to model complex, high-dimensional relationships through contextual attention rather than global feature selection. The paper argues that higher education analytics remains largely reductionist, relying on limited variables such as GPA, demographics, and course completion rates to identify &amp;amp;ldquo;at-risk&amp;amp;rdquo; students. While interpretable, these approaches often fail to capture the dynamic and multidimensional nature of student success. In response, this study proposes a transition toward over-parameterized personalization, where students&amp;amp;rsquo; academic and behavioral histories are modeled as longitudinal high-dimensional sequences. Drawing parallels to commercial recommendation systems such as Amazon, Netflix, and YouTube, the paper explores how higher education can move from generalized early-warning systems toward adaptive &amp;amp;ldquo;n-of-1&amp;amp;rdquo; interventions. Importantly, the paper is conceptual rather than empirical: it develops a research agenda and a set of testable propositions, and it identifies the evaluation designs&amp;amp;mdash;temporally valid prediction protocols and causal intervention studies&amp;amp;mdash;by which the promise of over-parameterized personalization in higher education should be assessed before any claim of superiority can be made.</description>
	<pubDate>2026-07-17</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 696: Beyond Occam&amp;rsquo;s Razor: Double Descent and the Potential Paradigm Shift Toward Over-Parameterized Personalization in Higher Education</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/696">doi: 10.3390/info17070696</a></p>
	<p>Authors:
		Chong Ho Yu
		Han Nee Chong
		</p>
	<p>This paper examines how the emergence of over-parameterized artificial intelligence models and the phenomenon of double descent challenge the classical assumption that simpler models generalize better. Traditional predictive analytics relied on parsimonious models grounded in the bias-variance trade-off, where increasing complexity was expected to produce overfitting. However, recent advances in deep learning demonstrate that highly over-parameterized models can achieve superior generalization after surpassing the interpolation threshold. This paradigm shift has enabled systems such as AlphaFold, Aurora, Delphi-2M, and recommenders to model complex, high-dimensional relationships through contextual attention rather than global feature selection. The paper argues that higher education analytics remains largely reductionist, relying on limited variables such as GPA, demographics, and course completion rates to identify &amp;amp;ldquo;at-risk&amp;amp;rdquo; students. While interpretable, these approaches often fail to capture the dynamic and multidimensional nature of student success. In response, this study proposes a transition toward over-parameterized personalization, where students&amp;amp;rsquo; academic and behavioral histories are modeled as longitudinal high-dimensional sequences. Drawing parallels to commercial recommendation systems such as Amazon, Netflix, and YouTube, the paper explores how higher education can move from generalized early-warning systems toward adaptive &amp;amp;ldquo;n-of-1&amp;amp;rdquo; interventions. Importantly, the paper is conceptual rather than empirical: it develops a research agenda and a set of testable propositions, and it identifies the evaluation designs&amp;amp;mdash;temporally valid prediction protocols and causal intervention studies&amp;amp;mdash;by which the promise of over-parameterized personalization in higher education should be assessed before any claim of superiority can be made.</p>
	]]></content:encoded>

	<dc:title>Beyond Occam&amp;amp;rsquo;s Razor: Double Descent and the Potential Paradigm Shift Toward Over-Parameterized Personalization in Higher Education</dc:title>
			<dc:creator>Chong Ho Yu</dc:creator>
			<dc:creator>Han Nee Chong</dc:creator>
		<dc:identifier>doi: 10.3390/info17070696</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-17</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-17</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Review</prism:section>
	<prism:startingPage>696</prism:startingPage>
		<prism:doi>10.3390/info17070696</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/696</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/695">

	<title>Information, Vol. 17, Pages 695: A Competency Framework for Human Interoperability in Data Spaces</title>
	<link>https://www.mdpi.com/2078-2489/17/7/695</link>
	<description>The growing deployment of European Data Spaces requires more than advanced technical infrastructures; it also demands specialised human competencies to ensure interoperability, governance, and trust. This paper redefines organisational readiness as a key indicator of the transition from experimental deployments to large-scale, governed data exchange. Although technical solutions provide the necessary foundation, training is essential to ensure that the digital transition is supported by professionals capable of operating these ecosystems effectively. To address the research question, &amp;amp;ldquo;Which competencies are required to enable data reuse within Data Spaces?&amp;amp;rdquo;, with a specific focus on spatial data and Urban Digital Twins, this study proposes a hybrid methodology. This approach combines a top-down analysis of reference architectures (e.g., EIF and DSSC Blueprint) with a bottom-up diagnosis based on an expert-based qualitative survey. Preliminary results suggest that, although 58% of organisations identify technical integration between BIM and GIS as the main obstacle, 47% identify the shortage of specialised skills as the primary bottleneck preventing operational maturity. The analysis reveals a Maturity Plateau that hinders the transition from technical connectivity (Data Space Maturity Model Level 2) to full operational maturity (Level 3). To overcome this barrier, the study presents a convergence matrix based on the DIS4SME initiative, mapping knowledge gaps to a competency roadmap. This framework identifies urgent training needs in the semantic and legal domains, and provides an operational guide for supporting organisational maturity across Data Spaces and strengthening professional expertise.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 695: A Competency Framework for Human Interoperability in Data Spaces</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/695">doi: 10.3390/info17070695</a></p>
	<p>Authors:
		Mayte Toscano Domínguez
		Giacomo Martirano
		Alfonso Quarati
		Monica De Martino
		</p>
	<p>The growing deployment of European Data Spaces requires more than advanced technical infrastructures; it also demands specialised human competencies to ensure interoperability, governance, and trust. This paper redefines organisational readiness as a key indicator of the transition from experimental deployments to large-scale, governed data exchange. Although technical solutions provide the necessary foundation, training is essential to ensure that the digital transition is supported by professionals capable of operating these ecosystems effectively. To address the research question, &amp;amp;ldquo;Which competencies are required to enable data reuse within Data Spaces?&amp;amp;rdquo;, with a specific focus on spatial data and Urban Digital Twins, this study proposes a hybrid methodology. This approach combines a top-down analysis of reference architectures (e.g., EIF and DSSC Blueprint) with a bottom-up diagnosis based on an expert-based qualitative survey. Preliminary results suggest that, although 58% of organisations identify technical integration between BIM and GIS as the main obstacle, 47% identify the shortage of specialised skills as the primary bottleneck preventing operational maturity. The analysis reveals a Maturity Plateau that hinders the transition from technical connectivity (Data Space Maturity Model Level 2) to full operational maturity (Level 3). To overcome this barrier, the study presents a convergence matrix based on the DIS4SME initiative, mapping knowledge gaps to a competency roadmap. This framework identifies urgent training needs in the semantic and legal domains, and provides an operational guide for supporting organisational maturity across Data Spaces and strengthening professional expertise.</p>
	]]></content:encoded>

	<dc:title>A Competency Framework for Human Interoperability in Data Spaces</dc:title>
			<dc:creator>Mayte Toscano Domínguez</dc:creator>
			<dc:creator>Giacomo Martirano</dc:creator>
			<dc:creator>Alfonso Quarati</dc:creator>
			<dc:creator>Monica De Martino</dc:creator>
		<dc:identifier>doi: 10.3390/info17070695</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>695</prism:startingPage>
		<prism:doi>10.3390/info17070695</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/695</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/692">

	<title>Information, Vol. 17, Pages 692: Assessing Information Security Risk Exposure During the Transition from ISO/IEC 27001:2013 to ISO/IEC 27001:2022 in a Banking Institution</title>
	<link>https://www.mdpi.com/2078-2489/17/7/692</link>
	<description>The transition from ISO/IEC 27001:2013 to ISO/IEC 27001:2022 is often approached as a certification and documentation update. However, for banking institutions with critical digital operations, the transition may create a distinct form of information security exposure when existing controls, evidence, ownership, and risk treatment decisions are not fully aligned with the revised control structure. This study examines transitional risk exposure in Bank XYZ, a banking institution with an established ISO/IEC 27001:2013-based Information Security Management System (ISMS). Using a qualitative single-case study design, the research analyzes ISMS documents, 96 information security risk records, Statement of Applicability records, control implementation evidence, ISO/IEC 27001:2013-to-ISO/IEC 27001:2022 control mapping materials, and stakeholder validation within the scope of core banking development and operations in data center and disaster recovery center environments. Risk exposure was assessed by comparing inherent and residual risks using a likelihood-impact matrix, while transition readiness was evaluated through control applicability, evidence adequacy, ownership clarity, supplier dependency, human factor readiness, and transition governance. The findings show that Bank XYZ implemented or provided evidence for 109 of 114 ISO/IEC 27001:2013 controls and reduced 96 inherent risks, consisting of 38 Moderate and 58 Moderate-to-High risks, into 13 Low and 83 Low-to-Moderate residual risks. Nevertheless, the transition review revealed that a mature residual risk position under ISO/IEC 27001:2013 does not automatically indicate readiness for ISO/IEC 27001:2022. Of 11 newly introduced controls, 2 were implemented, 4 were partially implemented, 4 were not implemented, and 1 was not applicable. The most significant transition gaps were found in threat intelligence, information deletion, data masking, and data leakage prevention. The study contributes by distinguishing transitional risk exposure from residual risk and by offering a control-level basis for prioritizing ISO/IEC 27001:2022 transition activities in banking institutions.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 692: Assessing Information Security Risk Exposure During the Transition from ISO/IEC 27001:2013 to ISO/IEC 27001:2022 in a Banking Institution</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/692">doi: 10.3390/info17070692</a></p>
	<p>Authors:
		Noviati Nurani
		Nilo Legowo
		</p>
	<p>The transition from ISO/IEC 27001:2013 to ISO/IEC 27001:2022 is often approached as a certification and documentation update. However, for banking institutions with critical digital operations, the transition may create a distinct form of information security exposure when existing controls, evidence, ownership, and risk treatment decisions are not fully aligned with the revised control structure. This study examines transitional risk exposure in Bank XYZ, a banking institution with an established ISO/IEC 27001:2013-based Information Security Management System (ISMS). Using a qualitative single-case study design, the research analyzes ISMS documents, 96 information security risk records, Statement of Applicability records, control implementation evidence, ISO/IEC 27001:2013-to-ISO/IEC 27001:2022 control mapping materials, and stakeholder validation within the scope of core banking development and operations in data center and disaster recovery center environments. Risk exposure was assessed by comparing inherent and residual risks using a likelihood-impact matrix, while transition readiness was evaluated through control applicability, evidence adequacy, ownership clarity, supplier dependency, human factor readiness, and transition governance. The findings show that Bank XYZ implemented or provided evidence for 109 of 114 ISO/IEC 27001:2013 controls and reduced 96 inherent risks, consisting of 38 Moderate and 58 Moderate-to-High risks, into 13 Low and 83 Low-to-Moderate residual risks. Nevertheless, the transition review revealed that a mature residual risk position under ISO/IEC 27001:2013 does not automatically indicate readiness for ISO/IEC 27001:2022. Of 11 newly introduced controls, 2 were implemented, 4 were partially implemented, 4 were not implemented, and 1 was not applicable. The most significant transition gaps were found in threat intelligence, information deletion, data masking, and data leakage prevention. The study contributes by distinguishing transitional risk exposure from residual risk and by offering a control-level basis for prioritizing ISO/IEC 27001:2022 transition activities in banking institutions.</p>
	]]></content:encoded>

	<dc:title>Assessing Information Security Risk Exposure During the Transition from ISO/IEC 27001:2013 to ISO/IEC 27001:2022 in a Banking Institution</dc:title>
			<dc:creator>Noviati Nurani</dc:creator>
			<dc:creator>Nilo Legowo</dc:creator>
		<dc:identifier>doi: 10.3390/info17070692</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>692</prism:startingPage>
		<prism:doi>10.3390/info17070692</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/692</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/694">

	<title>Information, Vol. 17, Pages 694: Operationalizing Accountable AI Through Traceable Governance Architecture for Institutional Decision Support</title>
	<link>https://www.mdpi.com/2078-2489/17/7/694</link>
	<description>Institutional artificial intelligence (AI) decision-support systems progressively evaluate cases, determine eligibility, and allocate resources; yet, predicted efficacy alone does not guarantee equity, contestability, or responsible utilization. Current research frequently considers fairness measures, explainability, human oversight, and organizational governance as rather distinct issues. This paper presents a traceable bias-auditing framework that amalgamates prediction, explanation, selective human review, and structured recording into a cohesive operational decision pathway. Through design science research, the artifact was exhibited in a controlled proof-of-concept utilizing 8000 synthetic institutional situations and historically biased data labels. The foundational classifier was a logistic regression model. Selective escalation is initiated by the proximity of boundaries, tension in explanation patterns, and the rules governing review priorities. Three situations were evaluated: baseline prediction, prediction with explanation alone, and comprehensive architecture with review and audit recording. Explanations enhanced reviewability but did not significantly alter fairness outcomes. The proposed architecture improved F1 from 0.781 to 0.795, reduced the demographic parity gap from 0.070 to 0.010, decreased the equal opportunity gap from 0.116 to 0.036, and improved audit completeness from 0.33 to 1.00, while escalating only 4.8% of cases for human review. The results indicate that explanations attain institutional significance solely when linked to procedural regulations and enduring records. The evaluation was simulation-based; thus, the results should be interpreted as proof-of-concept evidence rather than direct field validation.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 694: Operationalizing Accountable AI Through Traceable Governance Architecture for Institutional Decision Support</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/694">doi: 10.3390/info17070694</a></p>
	<p>Authors:
		Abdalilah Alhalangy
		</p>
	<p>Institutional artificial intelligence (AI) decision-support systems progressively evaluate cases, determine eligibility, and allocate resources; yet, predicted efficacy alone does not guarantee equity, contestability, or responsible utilization. Current research frequently considers fairness measures, explainability, human oversight, and organizational governance as rather distinct issues. This paper presents a traceable bias-auditing framework that amalgamates prediction, explanation, selective human review, and structured recording into a cohesive operational decision pathway. Through design science research, the artifact was exhibited in a controlled proof-of-concept utilizing 8000 synthetic institutional situations and historically biased data labels. The foundational classifier was a logistic regression model. Selective escalation is initiated by the proximity of boundaries, tension in explanation patterns, and the rules governing review priorities. Three situations were evaluated: baseline prediction, prediction with explanation alone, and comprehensive architecture with review and audit recording. Explanations enhanced reviewability but did not significantly alter fairness outcomes. The proposed architecture improved F1 from 0.781 to 0.795, reduced the demographic parity gap from 0.070 to 0.010, decreased the equal opportunity gap from 0.116 to 0.036, and improved audit completeness from 0.33 to 1.00, while escalating only 4.8% of cases for human review. The results indicate that explanations attain institutional significance solely when linked to procedural regulations and enduring records. The evaluation was simulation-based; thus, the results should be interpreted as proof-of-concept evidence rather than direct field validation.</p>
	]]></content:encoded>

	<dc:title>Operationalizing Accountable AI Through Traceable Governance Architecture for Institutional Decision Support</dc:title>
			<dc:creator>Abdalilah Alhalangy</dc:creator>
		<dc:identifier>doi: 10.3390/info17070694</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>694</prism:startingPage>
		<prism:doi>10.3390/info17070694</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/694</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/693">

	<title>Information, Vol. 17, Pages 693: HybridSkinLes: An Explainable CNN-and Transformer-Based Multi-Class Skin Lesion Classification Framework</title>
	<link>https://www.mdpi.com/2078-2489/17/7/693</link>
	<description>Skin cancer is considered a deadly disease globally, and the timely identification of the disease may save human life. This research presents a CNN&amp;amp;ndash;Transformer-based fusion framework for automated multi-class skin lesion classification. This approach combines ResNet50 and Vision Transformer (ViT) to categorize skin lesions using the HAM10000 dataset. To assess their efficacy, a comparison with CNN and ViT models is also carried out. Seven classes of skin cancer are used for training the models, and class weighting is used to correct dataset asymmetry. According to the experimental dataset, the suggested hybrid framework shows improved performance over CNN and ViT, considering the accuracy (0.97) and macro-averaged F1-score (0.95). Furthermore, the efficiency of the suggested model is demonstrated by the fact that it delivers performance that is competitive with several existing approaches. Overall results indicate that hybrid CNN&amp;amp;ndash;Transformer architectures present a viable path for automated skin lesion categorization. Grad-CAM++ is integrated to enhance model understanding and promote medical confidence by enabling physicians to view visualizations that show the areas impacting the model&amp;amp;rsquo;s conclusions. But there are still issues, including poor generalization, computational complexity, and a lack of external validation. Future research will concentrate on enhancing interpretability for practical implementation, integrating clinical information, and evaluating several datasets.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 693: HybridSkinLes: An Explainable CNN-and Transformer-Based Multi-Class Skin Lesion Classification Framework</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/693">doi: 10.3390/info17070693</a></p>
	<p>Authors:
		May Issa Aldossary
		Hina Gull
		</p>
	<p>Skin cancer is considered a deadly disease globally, and the timely identification of the disease may save human life. This research presents a CNN&amp;amp;ndash;Transformer-based fusion framework for automated multi-class skin lesion classification. This approach combines ResNet50 and Vision Transformer (ViT) to categorize skin lesions using the HAM10000 dataset. To assess their efficacy, a comparison with CNN and ViT models is also carried out. Seven classes of skin cancer are used for training the models, and class weighting is used to correct dataset asymmetry. According to the experimental dataset, the suggested hybrid framework shows improved performance over CNN and ViT, considering the accuracy (0.97) and macro-averaged F1-score (0.95). Furthermore, the efficiency of the suggested model is demonstrated by the fact that it delivers performance that is competitive with several existing approaches. Overall results indicate that hybrid CNN&amp;amp;ndash;Transformer architectures present a viable path for automated skin lesion categorization. Grad-CAM++ is integrated to enhance model understanding and promote medical confidence by enabling physicians to view visualizations that show the areas impacting the model&amp;amp;rsquo;s conclusions. But there are still issues, including poor generalization, computational complexity, and a lack of external validation. Future research will concentrate on enhancing interpretability for practical implementation, integrating clinical information, and evaluating several datasets.</p>
	]]></content:encoded>

	<dc:title>HybridSkinLes: An Explainable CNN-and Transformer-Based Multi-Class Skin Lesion Classification Framework</dc:title>
			<dc:creator>May Issa Aldossary</dc:creator>
			<dc:creator>Hina Gull</dc:creator>
		<dc:identifier>doi: 10.3390/info17070693</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>693</prism:startingPage>
		<prism:doi>10.3390/info17070693</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/693</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/691">

	<title>Information, Vol. 17, Pages 691: Dynamic Cost Prediction for State Grid Engineering Projects Based on Multi-Source Business Data Fusion and Data-Driven Methods</title>
	<link>https://www.mdpi.com/2078-2489/17/7/691</link>
	<description>Accurate dynamic cost prediction is essential for budget optimization and risk mitigation in State Grid projects. However, traditional models and even recent deep learning approaches fall short, as they treat cost drivers independently, adopt simplistic concatenation that destroys sourcewise structure, or fail to handle irregularly sampled and partially missing multi-source data. This paper proposes a novel data-driven framework that integrates multi-source business data through a hierarchical tensor fusion mechanism and a hybrid spatiotemporal architecture. The problem is formalized as multivariate time-series prediction with irregular sampling and missing modalities. The framework comprises three synergistic innovations: a differentiable low-rank CANDECOMP/PARAFAC (CP) decomposition layer with adaptive attention weights that preserves cross-source structure while enabling compact dimensionality reduction; a spatiotemporal attention-based bidirectional gated recurrent unit (Bi-GRU) that captures long-range temporal dependencies; and a graph convolutional network (GCN) that explicitly learns interrelations among cost drivers, a capability absent in most existing forecasting methods. The entire system is trained end to end with a customized loss combining mean squared error, quantile loss, and temporal consistency regularization. Extensive experiments on three State Grid substation projects demonstrate that the proposed method outperforms state-of-the-art baselines by 12.7&amp;amp;ndash;18.4% in MAPE and maintains robust performance with up to 40% of data missing. These results confirm that explicitly modeling both temporal evolution and driver interdependencies within a unified fusion framework is the key to reliable cost forecasting in large-scale infrastructure projects.</description>
	<pubDate>2026-07-16</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 691: Dynamic Cost Prediction for State Grid Engineering Projects Based on Multi-Source Business Data Fusion and Data-Driven Methods</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/691">doi: 10.3390/info17070691</a></p>
	<p>Authors:
		Weiqiong Wang
		Qidong Xu
		Tianyu Zhao
		Fang Fang
		</p>
	<p>Accurate dynamic cost prediction is essential for budget optimization and risk mitigation in State Grid projects. However, traditional models and even recent deep learning approaches fall short, as they treat cost drivers independently, adopt simplistic concatenation that destroys sourcewise structure, or fail to handle irregularly sampled and partially missing multi-source data. This paper proposes a novel data-driven framework that integrates multi-source business data through a hierarchical tensor fusion mechanism and a hybrid spatiotemporal architecture. The problem is formalized as multivariate time-series prediction with irregular sampling and missing modalities. The framework comprises three synergistic innovations: a differentiable low-rank CANDECOMP/PARAFAC (CP) decomposition layer with adaptive attention weights that preserves cross-source structure while enabling compact dimensionality reduction; a spatiotemporal attention-based bidirectional gated recurrent unit (Bi-GRU) that captures long-range temporal dependencies; and a graph convolutional network (GCN) that explicitly learns interrelations among cost drivers, a capability absent in most existing forecasting methods. The entire system is trained end to end with a customized loss combining mean squared error, quantile loss, and temporal consistency regularization. Extensive experiments on three State Grid substation projects demonstrate that the proposed method outperforms state-of-the-art baselines by 12.7&amp;amp;ndash;18.4% in MAPE and maintains robust performance with up to 40% of data missing. These results confirm that explicitly modeling both temporal evolution and driver interdependencies within a unified fusion framework is the key to reliable cost forecasting in large-scale infrastructure projects.</p>
	]]></content:encoded>

	<dc:title>Dynamic Cost Prediction for State Grid Engineering Projects Based on Multi-Source Business Data Fusion and Data-Driven Methods</dc:title>
			<dc:creator>Weiqiong Wang</dc:creator>
			<dc:creator>Qidong Xu</dc:creator>
			<dc:creator>Tianyu Zhao</dc:creator>
			<dc:creator>Fang Fang</dc:creator>
		<dc:identifier>doi: 10.3390/info17070691</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-16</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-16</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>691</prism:startingPage>
		<prism:doi>10.3390/info17070691</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/691</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/690">

	<title>Information, Vol. 17, Pages 690: Evaluating ASR Pipeline Configurations for Kazakh: Implications for Low-Resource Turkic Languages</title>
	<link>https://www.mdpi.com/2078-2489/17/7/690</link>
	<description>Kazakh automatic speech recognition (ASR) presents a persistent challenge for large-scale multilingual models. This paper presents a systematic evaluation of 27 ASR pipeline configurations (three ASR models &amp;amp;times; three VAD methods &amp;amp;times; three post-processing strategies) on the Kazakh Speech Dataset (KSD), examining the contribution of model fine-tuning, voice activity detection (VAD) preprocessing, and large language model (LLM) post-correction and benchmarking the resulting pipelines against two non-Whisper foundation models. Language-specific fine-tuning reduces Word Error Rate (WER) from 43.20% (generic Whisper-large-v3) to 11.88% (Kazakh fine-tuned Whisper-turbo), a 31.32-percentage-point absolute reduction (72.5% relative; p &amp;amp;lt; 0.001, bootstrap test); the effect persists after controlling for model size (generic Whisper-large-v3-turbo, 18.92%, vs. the same architecture after fine-tuning, 11.88%; p &amp;amp;lt; 0.001). VAD preprocessing consistently degrades performance. Zero-shot post-correction with general-purpose LLMs yields no benefit and adds substantial latency: Gemma-2-9B and Qwen2.5-7B raise WER by 5.5 and 7.2 percentage points at real-time factors of 0.52 and 0.30, and a larger 32B model still degrades accuracy (+10.8 points), indicating that scale is not the limiting factor. Among all systems evaluated, a larger multilingual foundation model, SeamlessM4T-v2 (9.72% WER), outperforms the fine-tuned Whisper, showing that for Kazakh model coverage matters more than pipeline engineering. Character-level error analysis identifies systematic confusion between Kazakh-specific and Russian Cyrillic characters as a dominant error source. These findings establish that, for Kazakh under the evaluated conditions, model choice dominates pipeline add-ons: fine-tuning is essential, VAD and zero-shot LLM correction consistently hurt, and a strong multilingual model sets the best result; we further discuss the extent to which these conclusions extend to typologically similar Kipchak-Turkic languages.</description>
	<pubDate>2026-07-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 690: Evaluating ASR Pipeline Configurations for Kazakh: Implications for Low-Resource Turkic Languages</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/690">doi: 10.3390/info17070690</a></p>
	<p>Authors:
		Nursultan Nyssanov
		Leila Rzayeva
		Alisher Batkuldin
		Zhaksylyk Kozhakhmet
		</p>
	<p>Kazakh automatic speech recognition (ASR) presents a persistent challenge for large-scale multilingual models. This paper presents a systematic evaluation of 27 ASR pipeline configurations (three ASR models &amp;amp;times; three VAD methods &amp;amp;times; three post-processing strategies) on the Kazakh Speech Dataset (KSD), examining the contribution of model fine-tuning, voice activity detection (VAD) preprocessing, and large language model (LLM) post-correction and benchmarking the resulting pipelines against two non-Whisper foundation models. Language-specific fine-tuning reduces Word Error Rate (WER) from 43.20% (generic Whisper-large-v3) to 11.88% (Kazakh fine-tuned Whisper-turbo), a 31.32-percentage-point absolute reduction (72.5% relative; p &amp;amp;lt; 0.001, bootstrap test); the effect persists after controlling for model size (generic Whisper-large-v3-turbo, 18.92%, vs. the same architecture after fine-tuning, 11.88%; p &amp;amp;lt; 0.001). VAD preprocessing consistently degrades performance. Zero-shot post-correction with general-purpose LLMs yields no benefit and adds substantial latency: Gemma-2-9B and Qwen2.5-7B raise WER by 5.5 and 7.2 percentage points at real-time factors of 0.52 and 0.30, and a larger 32B model still degrades accuracy (+10.8 points), indicating that scale is not the limiting factor. Among all systems evaluated, a larger multilingual foundation model, SeamlessM4T-v2 (9.72% WER), outperforms the fine-tuned Whisper, showing that for Kazakh model coverage matters more than pipeline engineering. Character-level error analysis identifies systematic confusion between Kazakh-specific and Russian Cyrillic characters as a dominant error source. These findings establish that, for Kazakh under the evaluated conditions, model choice dominates pipeline add-ons: fine-tuning is essential, VAD and zero-shot LLM correction consistently hurt, and a strong multilingual model sets the best result; we further discuss the extent to which these conclusions extend to typologically similar Kipchak-Turkic languages.</p>
	]]></content:encoded>

	<dc:title>Evaluating ASR Pipeline Configurations for Kazakh: Implications for Low-Resource Turkic Languages</dc:title>
			<dc:creator>Nursultan Nyssanov</dc:creator>
			<dc:creator>Leila Rzayeva</dc:creator>
			<dc:creator>Alisher Batkuldin</dc:creator>
			<dc:creator>Zhaksylyk Kozhakhmet</dc:creator>
		<dc:identifier>doi: 10.3390/info17070690</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>690</prism:startingPage>
		<prism:doi>10.3390/info17070690</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/690</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/689">

	<title>Information, Vol. 17, Pages 689: Visual Semantics in MT Evaluation: Do Image Descriptions Help with Assessment of Multimodal MT Quality?</title>
	<link>https://www.mdpi.com/2078-2489/17/7/689</link>
	<description>Multimodal machine translation (MMT) aims to integrate visual context with textual data to improve the translation of ambiguous source text, such as the inclusion of an image as additional context. However, the evaluation of systems largely still relies on automatic metrics designed to evaluate text alone, and do not account for additional modalities during evaluation. The lack of dedicated MMT evaluation methods often results in inconsistent findings and creates uncertainty regarding the actual contribution of visual context in translation. In this work, we examine the performance of state-of-the-art trained and untrained evaluation metrics, particularly when comparing multimodal and text-only systems. Our evaluation focuses on the degree to which existing metrics are sensitive enough to distinguish between multimodal and text-only machine translation systems. We further investigate the potential for automatically generated image descriptions to serve as effective contextual signals for improving metric sensitivity to multimodal tasks. Our results show that incorporating such visual information into supervised metrics yields better alignment with human judgment. While all metrics successfully distinguished image-aware from image-agnostic systems on general test sets, both n-gram-based and embedding-based metrics struggled with respect to contrastive evaluation designed to capture context-dependent errors. Furthermore, we discuss how the presence of visual context may influence human evaluator judgment, observing that given the opportunity, human ratings are often substantially revised, further emphasizing the critical role of context in the evaluation of MMT.</description>
	<pubDate>2026-07-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 689: Visual Semantics in MT Evaluation: Do Image Descriptions Help with Assessment of Multimodal MT Quality?</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/689">doi: 10.3390/info17070689</a></p>
	<p>Authors:
		Sami Ul Haq
		Sheila Castilho
		Yvette Graham
		</p>
	<p>Multimodal machine translation (MMT) aims to integrate visual context with textual data to improve the translation of ambiguous source text, such as the inclusion of an image as additional context. However, the evaluation of systems largely still relies on automatic metrics designed to evaluate text alone, and do not account for additional modalities during evaluation. The lack of dedicated MMT evaluation methods often results in inconsistent findings and creates uncertainty regarding the actual contribution of visual context in translation. In this work, we examine the performance of state-of-the-art trained and untrained evaluation metrics, particularly when comparing multimodal and text-only systems. Our evaluation focuses on the degree to which existing metrics are sensitive enough to distinguish between multimodal and text-only machine translation systems. We further investigate the potential for automatically generated image descriptions to serve as effective contextual signals for improving metric sensitivity to multimodal tasks. Our results show that incorporating such visual information into supervised metrics yields better alignment with human judgment. While all metrics successfully distinguished image-aware from image-agnostic systems on general test sets, both n-gram-based and embedding-based metrics struggled with respect to contrastive evaluation designed to capture context-dependent errors. Furthermore, we discuss how the presence of visual context may influence human evaluator judgment, observing that given the opportunity, human ratings are often substantially revised, further emphasizing the critical role of context in the evaluation of MMT.</p>
	]]></content:encoded>

	<dc:title>Visual Semantics in MT Evaluation: Do Image Descriptions Help with Assessment of Multimodal MT Quality?</dc:title>
			<dc:creator>Sami Ul Haq</dc:creator>
			<dc:creator>Sheila Castilho</dc:creator>
			<dc:creator>Yvette Graham</dc:creator>
		<dc:identifier>doi: 10.3390/info17070689</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>689</prism:startingPage>
		<prism:doi>10.3390/info17070689</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/689</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/688">

	<title>Information, Vol. 17, Pages 688: Changes in Pre-Service Physics Teachers&amp;rsquo; TPACK and Collaborative Problem Solving Associated with an AI-Supported CTD-PBL Module: A Quasi-Experimental Study</title>
	<link>https://www.mdpi.com/2078-2489/17/7/688</link>
	<description>Generative artificial intelligence (AI) is increasingly entering teacher education, yet evidence remains limited on its responsible integration into discipline-specific pedagogical preparation. This study examined whether an AI-supported Collaborative TPACK Competency Development module based on problem-based learning (CTD-PBL) was associated with greater pre&amp;amp;ndash;post gains in pre-service physics teachers&amp;amp;rsquo; self-reported technological pedagogical content knowledge (TPACK) and perceived collaborative problem-solving (CPS) processes. Informed by ADDIE, the 8-week module used DeepSeek as a bounded scaffold for collaborative lesson design, feedback, verification, and reflective revision while preserving teacher judgment. An intact-class quasi-experimental pre-test/post-test design involved 130 third-year pre-service physics teachers at a public university in western China. Two existing classes were randomly allocated at the class level to CTD-PBL or conventional instruction. Compared with the conventional group, the CTD-PBL group reported higher post-test TPACK scores (M = 4.04 vs. M = 3.40, p &amp;amp;lt; 0.001, d = 1.02) and higher perceived CPS process scores (M = 3.62 vs. M = 3.05, p &amp;amp;lt; 0.001, d = 0.88), with stronger pre&amp;amp;ndash;post gains in both outcomes. The findings provide a bounded curriculum design case showing how generative AI can be embedded in physics teacher education through problem-based tasks, collaborative scaffolding, and human verification procedures.</description>
	<pubDate>2026-07-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 688: Changes in Pre-Service Physics Teachers&amp;rsquo; TPACK and Collaborative Problem Solving Associated with an AI-Supported CTD-PBL Module: A Quasi-Experimental Study</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/688">doi: 10.3390/info17070688</a></p>
	<p>Authors:
		Qirui Chen
		Kamisah Osman
		</p>
	<p>Generative artificial intelligence (AI) is increasingly entering teacher education, yet evidence remains limited on its responsible integration into discipline-specific pedagogical preparation. This study examined whether an AI-supported Collaborative TPACK Competency Development module based on problem-based learning (CTD-PBL) was associated with greater pre&amp;amp;ndash;post gains in pre-service physics teachers&amp;amp;rsquo; self-reported technological pedagogical content knowledge (TPACK) and perceived collaborative problem-solving (CPS) processes. Informed by ADDIE, the 8-week module used DeepSeek as a bounded scaffold for collaborative lesson design, feedback, verification, and reflective revision while preserving teacher judgment. An intact-class quasi-experimental pre-test/post-test design involved 130 third-year pre-service physics teachers at a public university in western China. Two existing classes were randomly allocated at the class level to CTD-PBL or conventional instruction. Compared with the conventional group, the CTD-PBL group reported higher post-test TPACK scores (M = 4.04 vs. M = 3.40, p &amp;amp;lt; 0.001, d = 1.02) and higher perceived CPS process scores (M = 3.62 vs. M = 3.05, p &amp;amp;lt; 0.001, d = 0.88), with stronger pre&amp;amp;ndash;post gains in both outcomes. The findings provide a bounded curriculum design case showing how generative AI can be embedded in physics teacher education through problem-based tasks, collaborative scaffolding, and human verification procedures.</p>
	]]></content:encoded>

	<dc:title>Changes in Pre-Service Physics Teachers&amp;amp;rsquo; TPACK and Collaborative Problem Solving Associated with an AI-Supported CTD-PBL Module: A Quasi-Experimental Study</dc:title>
			<dc:creator>Qirui Chen</dc:creator>
			<dc:creator>Kamisah Osman</dc:creator>
		<dc:identifier>doi: 10.3390/info17070688</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>688</prism:startingPage>
		<prism:doi>10.3390/info17070688</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/688</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/687">

	<title>Information, Vol. 17, Pages 687: M2WPR-Net: Robust Multimodal Weld Quality Assessment via Cross-Modal Attention</title>
	<link>https://www.mdpi.com/2078-2489/17/7/687</link>
	<description>Robust monitoring of weld pool dynamics is critical for automated arc welding; however, single-modality sensors are frequently constrained by severe optical interference and high-frequency environmental noise. To address these limitations, we propose M2WPR-Net, a novel multimodal framework that synergizes visual and acoustic signals for simultaneous weld width regression and physical quality classification. The architecture employs a dual-stream ResNet50 backbone to process heterogeneous sensory data. Specifically, the visual stream utilizes a Convolutional Block Attention Module (CBAM) to suppress intense arc glare and localize the weld pool. Concurrently, the acoustic stream transforms 1D audio sequences into 2D Gramian Angular Summation Field (GASF) textures, which are subsequently refined by Squeeze-and-Excitation (SE) networks to isolate target frequency channels. A central contribution of this study is a bidirectional cross-modal attention mechanism based on Query&amp;amp;ndash;Key&amp;amp;ndash;Value (Q-K-V) matrix operations. Overcoming the shortcomings of static feature concatenation, this module dynamically aligns the modalities, enabling acoustic cues to guide visual feature extraction and vice versa, thereby mitigating information bottlenecks. Optimized via a joint multi-task loss function, the proposed M2WPR-Net significantly outperforms existing single-modal and conventional fusion baselines. Experimental results demonstrate that the network achieves a Mean Absolute Error (MAE) of 0.18 mm for width prediction and a 93.5% accuracy in penetration state classification, confirming its resilience and practical applicability in complex industrial welding environments.</description>
	<pubDate>2026-07-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 687: M2WPR-Net: Robust Multimodal Weld Quality Assessment via Cross-Modal Attention</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/687">doi: 10.3390/info17070687</a></p>
	<p>Authors:
		Ao Han
		Tongyu Zhao
		Yanjun Pei
		Haining Chen
		Jun Zhou
		Hailei Yuan
		Pan Hu
		</p>
	<p>Robust monitoring of weld pool dynamics is critical for automated arc welding; however, single-modality sensors are frequently constrained by severe optical interference and high-frequency environmental noise. To address these limitations, we propose M2WPR-Net, a novel multimodal framework that synergizes visual and acoustic signals for simultaneous weld width regression and physical quality classification. The architecture employs a dual-stream ResNet50 backbone to process heterogeneous sensory data. Specifically, the visual stream utilizes a Convolutional Block Attention Module (CBAM) to suppress intense arc glare and localize the weld pool. Concurrently, the acoustic stream transforms 1D audio sequences into 2D Gramian Angular Summation Field (GASF) textures, which are subsequently refined by Squeeze-and-Excitation (SE) networks to isolate target frequency channels. A central contribution of this study is a bidirectional cross-modal attention mechanism based on Query&amp;amp;ndash;Key&amp;amp;ndash;Value (Q-K-V) matrix operations. Overcoming the shortcomings of static feature concatenation, this module dynamically aligns the modalities, enabling acoustic cues to guide visual feature extraction and vice versa, thereby mitigating information bottlenecks. Optimized via a joint multi-task loss function, the proposed M2WPR-Net significantly outperforms existing single-modal and conventional fusion baselines. Experimental results demonstrate that the network achieves a Mean Absolute Error (MAE) of 0.18 mm for width prediction and a 93.5% accuracy in penetration state classification, confirming its resilience and practical applicability in complex industrial welding environments.</p>
	]]></content:encoded>

	<dc:title>M2WPR-Net: Robust Multimodal Weld Quality Assessment via Cross-Modal Attention</dc:title>
			<dc:creator>Ao Han</dc:creator>
			<dc:creator>Tongyu Zhao</dc:creator>
			<dc:creator>Yanjun Pei</dc:creator>
			<dc:creator>Haining Chen</dc:creator>
			<dc:creator>Jun Zhou</dc:creator>
			<dc:creator>Hailei Yuan</dc:creator>
			<dc:creator>Pan Hu</dc:creator>
		<dc:identifier>doi: 10.3390/info17070687</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>687</prism:startingPage>
		<prism:doi>10.3390/info17070687</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/687</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/686">

	<title>Information, Vol. 17, Pages 686: Lane-Based Vehicle Counting System for Complex Traffic Scenes</title>
	<link>https://www.mdpi.com/2078-2489/17/7/686</link>
	<description>To address the reliance on manual calibration and the performance degradation caused by loosely coupled modules in lane-wise vehicle counting under complex traffic scenarios, this paper presents a lane-wise vehicle counting system based on adaptive lane partitioning and multi-module integration. The system first applies YOLOPv2 for lane-line detection, providing the basis for lane-region partitioning. Subsequently, Hue-Saturation-Value (HSV) color segmentation, morphological processing, and contour filtering are employed to enhance the robustness of lane feature extraction. Leveraging perspective geometry, lane regions are constructed to achieve adaptive lane partitioning. For vehicle analysis, YOLOv11 is utilized for vehicle detection, and ByteTrack is adopted for multi-object tracking. These modules are combined with lane assignment to form an integrated pipeline that preserves trajectory continuity and mitigates identity loss under occlusion and motion blur. Furthermore, a PyQt5-based interactive visualization interface is developed to support video processing, real-time display, lane-region visualization, and statistical analysis of per-lane traffic flow and lane-change behaviors. Experimental results demonstrate the effectiveness and practicality of the proposed system in complex multi-lane traffic scenarios.</description>
	<pubDate>2026-07-15</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 686: Lane-Based Vehicle Counting System for Complex Traffic Scenes</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/686">doi: 10.3390/info17070686</a></p>
	<p>Authors:
		Zhenyang Hu
		Zhandong Liu
		Ruixia Song
		Ke Li
		Shuping Chen
		Zhihua Wang
		Yong Li
		Xiangwei Qi
		</p>
	<p>To address the reliance on manual calibration and the performance degradation caused by loosely coupled modules in lane-wise vehicle counting under complex traffic scenarios, this paper presents a lane-wise vehicle counting system based on adaptive lane partitioning and multi-module integration. The system first applies YOLOPv2 for lane-line detection, providing the basis for lane-region partitioning. Subsequently, Hue-Saturation-Value (HSV) color segmentation, morphological processing, and contour filtering are employed to enhance the robustness of lane feature extraction. Leveraging perspective geometry, lane regions are constructed to achieve adaptive lane partitioning. For vehicle analysis, YOLOv11 is utilized for vehicle detection, and ByteTrack is adopted for multi-object tracking. These modules are combined with lane assignment to form an integrated pipeline that preserves trajectory continuity and mitigates identity loss under occlusion and motion blur. Furthermore, a PyQt5-based interactive visualization interface is developed to support video processing, real-time display, lane-region visualization, and statistical analysis of per-lane traffic flow and lane-change behaviors. Experimental results demonstrate the effectiveness and practicality of the proposed system in complex multi-lane traffic scenarios.</p>
	]]></content:encoded>

	<dc:title>Lane-Based Vehicle Counting System for Complex Traffic Scenes</dc:title>
			<dc:creator>Zhenyang Hu</dc:creator>
			<dc:creator>Zhandong Liu</dc:creator>
			<dc:creator>Ruixia Song</dc:creator>
			<dc:creator>Ke Li</dc:creator>
			<dc:creator>Shuping Chen</dc:creator>
			<dc:creator>Zhihua Wang</dc:creator>
			<dc:creator>Yong Li</dc:creator>
			<dc:creator>Xiangwei Qi</dc:creator>
		<dc:identifier>doi: 10.3390/info17070686</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-15</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-15</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>686</prism:startingPage>
		<prism:doi>10.3390/info17070686</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/686</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/685">

	<title>Information, Vol. 17, Pages 685: Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance</title>
	<link>https://www.mdpi.com/2078-2489/17/7/685</link>
	<description>The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let ek(n) denote the average edit distance between random, independent strings of n characters from an alphabet of size k. This paper is concerned with the efficient computation of &amp;amp;alpha;k(n)=ek(n)/n as well as of &amp;amp;alpha;k=limn&amp;amp;rarr;&amp;amp;infin;&amp;amp;alpha;k(n). It is shown that &amp;amp;alpha;k(n)&amp;amp;minus;&amp;amp;Theta;(logn/n)&amp;amp;le;&amp;amp;alpha;k&amp;amp;le;&amp;amp;alpha;k(n) and that &amp;amp;alpha;k is computable. An algorithm for the exact computation of &amp;amp;alpha;k(n) is presented with running time T=O(n2kmin(3n,kn)) thus, of limited practical use. An analysis of Monte Carlo estimates, based on McDiarmid&amp;amp;rsquo;s inequality, shows how &amp;amp;alpha;k(n) can be evaluated with good accuracy and high confidence level, for rather large values of n. In particular, 99.9% confidence intervals of width approximately 10&amp;amp;minus;2 are obtained for &amp;amp;alpha;k. An efficiently computable lower bound &amp;amp;beta;k* to &amp;amp;alpha;k is derived, with limk&amp;amp;rarr;&amp;amp;infin;&amp;amp;beta;k*=1. For k greater than a few dozens, significant bounds on &amp;amp;alpha;k can be obtained faster via &amp;amp;beta;k* than by statistical methods. The above techniques yield improvements on most previous numerical estimates as well as results for alphabet sizes and string lengths not reported before.</description>
	<pubDate>2026-07-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 685: Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/685">doi: 10.3390/info17070685</a></p>
	<p>Authors:
		Gianfranco Bilardi
		Michele Schimd
		</p>
	<p>The edit distance is a metric of dissimilarity between strings, widely applied in computational biology, speech recognition, and machine learning. Let ek(n) denote the average edit distance between random, independent strings of n characters from an alphabet of size k. This paper is concerned with the efficient computation of &amp;amp;alpha;k(n)=ek(n)/n as well as of &amp;amp;alpha;k=limn&amp;amp;rarr;&amp;amp;infin;&amp;amp;alpha;k(n). It is shown that &amp;amp;alpha;k(n)&amp;amp;minus;&amp;amp;Theta;(logn/n)&amp;amp;le;&amp;amp;alpha;k&amp;amp;le;&amp;amp;alpha;k(n) and that &amp;amp;alpha;k is computable. An algorithm for the exact computation of &amp;amp;alpha;k(n) is presented with running time T=O(n2kmin(3n,kn)) thus, of limited practical use. An analysis of Monte Carlo estimates, based on McDiarmid&amp;amp;rsquo;s inequality, shows how &amp;amp;alpha;k(n) can be evaluated with good accuracy and high confidence level, for rather large values of n. In particular, 99.9% confidence intervals of width approximately 10&amp;amp;minus;2 are obtained for &amp;amp;alpha;k. An efficiently computable lower bound &amp;amp;beta;k* to &amp;amp;alpha;k is derived, with limk&amp;amp;rarr;&amp;amp;infin;&amp;amp;beta;k*=1. For k greater than a few dozens, significant bounds on &amp;amp;alpha;k can be obtained faster via &amp;amp;beta;k* than by statistical methods. The above techniques yield improvements on most previous numerical estimates as well as results for alphabet sizes and string lengths not reported before.</p>
	]]></content:encoded>

	<dc:title>Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance</dc:title>
			<dc:creator>Gianfranco Bilardi</dc:creator>
			<dc:creator>Michele Schimd</dc:creator>
		<dc:identifier>doi: 10.3390/info17070685</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>685</prism:startingPage>
		<prism:doi>10.3390/info17070685</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/685</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/684">

	<title>Information, Vol. 17, Pages 684: A Lightweight and Efficient Deep Learning Model Based on Improved YOLOv12 for Fall Detection in College Sport Activities</title>
	<link>https://www.mdpi.com/2078-2489/17/7/684</link>
	<description>Rapid and accurate fall detection for college students plays a crucial role in enhancing the level of intelligent safety management and improving emergency response mechanisms in universities. Existing models often struggle to achieve a satisfactory balance between efficiency and robustness. To address this, we propose an improved YOLOv12 as the baseline and introduce weighted convolution (WConv) to reduce computational complexity. Additionally, we integrate channel reduction attention (CRA) to strengthen the model&amp;amp;rsquo;s anti-interference capability. Experimental results demonstrate that the proposed method achieves a mAP@50 of 99.5% and a mAP@[0.5:0.95] of 92.38% on our dataset, with a single-frame inference time of 443 ms. The proposed model strikes a well-balanced and effective trade-off between accuracy and speed, making it particularly suitable for deployment on embedded terminals and offering a reliable monitoring solution for physical education instruction.</description>
	<pubDate>2026-07-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 684: A Lightweight and Efficient Deep Learning Model Based on Improved YOLOv12 for Fall Detection in College Sport Activities</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/684">doi: 10.3390/info17070684</a></p>
	<p>Authors:
		Bingxu Cao
		Lu Zhao
		Hao Zhao
		Hao Xi
		Laixiang Xu
		Shengyuan Yang
		</p>
	<p>Rapid and accurate fall detection for college students plays a crucial role in enhancing the level of intelligent safety management and improving emergency response mechanisms in universities. Existing models often struggle to achieve a satisfactory balance between efficiency and robustness. To address this, we propose an improved YOLOv12 as the baseline and introduce weighted convolution (WConv) to reduce computational complexity. Additionally, we integrate channel reduction attention (CRA) to strengthen the model&amp;amp;rsquo;s anti-interference capability. Experimental results demonstrate that the proposed method achieves a mAP@50 of 99.5% and a mAP@[0.5:0.95] of 92.38% on our dataset, with a single-frame inference time of 443 ms. The proposed model strikes a well-balanced and effective trade-off between accuracy and speed, making it particularly suitable for deployment on embedded terminals and offering a reliable monitoring solution for physical education instruction.</p>
	]]></content:encoded>

	<dc:title>A Lightweight and Efficient Deep Learning Model Based on Improved YOLOv12 for Fall Detection in College Sport Activities</dc:title>
			<dc:creator>Bingxu Cao</dc:creator>
			<dc:creator>Lu Zhao</dc:creator>
			<dc:creator>Hao Zhao</dc:creator>
			<dc:creator>Hao Xi</dc:creator>
			<dc:creator>Laixiang Xu</dc:creator>
			<dc:creator>Shengyuan Yang</dc:creator>
		<dc:identifier>doi: 10.3390/info17070684</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>684</prism:startingPage>
		<prism:doi>10.3390/info17070684</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/684</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/683">

	<title>Information, Vol. 17, Pages 683: Road Damage Detection with Direction Awareness and Feature Equalization</title>
	<link>https://www.mdpi.com/2078-2489/17/7/683</link>
	<description>In the field of road damage detection, the accuracy of existing methods still requires further improvement, particularly for elongated cracks, which are crucial for ensuring driving safety and effective road maintenance. To address this limitation, a novel road damage detection algorithm is proposed based on direction awareness and feature equalization. Specifically, a Direction-aware Strip Convolution (DSC) module is constructed to effectively capture the geometric characteristics of elongated cracks and maintain computational efficiency, by integrating asymmetric strip convolution and depthwise separable convolution respectively. In addition, a Multi-level Feature Equalization (MFE) module is designed to address the complex morphology and significant scale variations of road damage during multi-level feature fusion. Specifically, a set of learnable spatial weighting parameters is introduced in this module, whose weighting coefficients are optimized across different network layers and adaptively generated, thereby modulating the contributions of multi-level features and promoting a more balanced multi-level feature representation. Experimental results on the RDD2022-based experimental dataset demonstrate that the proposed method improves mAP@50 by 5.8 percentage points and recall by 5.9 percentage points, while achieving a processing speed of 122 FPS. Notably, the proposed method improves the detection performance of elongated cracks and achieves relatively balanced performance gains across different road damage categories, compared with the baseline model.</description>
	<pubDate>2026-07-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 683: Road Damage Detection with Direction Awareness and Feature Equalization</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/683">doi: 10.3390/info17070683</a></p>
	<p>Authors:
		Yutao Wang
		Zhengzheng Zhu
		Yongqiang Bai
		Zhibo Xie
		Renwei Tu
		</p>
	<p>In the field of road damage detection, the accuracy of existing methods still requires further improvement, particularly for elongated cracks, which are crucial for ensuring driving safety and effective road maintenance. To address this limitation, a novel road damage detection algorithm is proposed based on direction awareness and feature equalization. Specifically, a Direction-aware Strip Convolution (DSC) module is constructed to effectively capture the geometric characteristics of elongated cracks and maintain computational efficiency, by integrating asymmetric strip convolution and depthwise separable convolution respectively. In addition, a Multi-level Feature Equalization (MFE) module is designed to address the complex morphology and significant scale variations of road damage during multi-level feature fusion. Specifically, a set of learnable spatial weighting parameters is introduced in this module, whose weighting coefficients are optimized across different network layers and adaptively generated, thereby modulating the contributions of multi-level features and promoting a more balanced multi-level feature representation. Experimental results on the RDD2022-based experimental dataset demonstrate that the proposed method improves mAP@50 by 5.8 percentage points and recall by 5.9 percentage points, while achieving a processing speed of 122 FPS. Notably, the proposed method improves the detection performance of elongated cracks and achieves relatively balanced performance gains across different road damage categories, compared with the baseline model.</p>
	]]></content:encoded>

	<dc:title>Road Damage Detection with Direction Awareness and Feature Equalization</dc:title>
			<dc:creator>Yutao Wang</dc:creator>
			<dc:creator>Zhengzheng Zhu</dc:creator>
			<dc:creator>Yongqiang Bai</dc:creator>
			<dc:creator>Zhibo Xie</dc:creator>
			<dc:creator>Renwei Tu</dc:creator>
		<dc:identifier>doi: 10.3390/info17070683</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>683</prism:startingPage>
		<prism:doi>10.3390/info17070683</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/683</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/682">

	<title>Information, Vol. 17, Pages 682: Addressing Extreme Baseline Imbalances in Quasi-Experimental Evaluation of AI-Driven Adaptive Cybersecurity Training: A Multi-Method Approach</title>
	<link>https://www.mdpi.com/2078-2489/17/7/682</link>
	<description>Despite widespread adoption of cybersecurity awareness training (CSAT), a persistent knowledge&amp;amp;ndash;behaviour gap continues to undermine organisational security posture, particularly in resource-constrained and developing-country contexts. This 12-week quasi-experimental field study evaluated an AI-adaptive CSAT platform against traditional instructor-led training (ILT) across three Yemeni organisations (total N = 187; AI-Adaptive: n = 94; Control: n = 93). The system used a 4-parameter Bayesian Knowledge Tracing (BKT) engine&amp;amp;mdash;with interpretable guess and slip signals&amp;amp;mdash;as an auditable pedagogical decision layer that triggered Protection Motivation Theory (PMT) and Theory of Planned Behavior (TPB)-aligned interventions. Extreme baseline imbalances (Cohen&amp;amp;rsquo;s d &amp;amp;gt; 2.0), at which standard ANCOVA residual adjustment alone is known to be biased and which necessitated advanced causal-inference triangulation, were addressed via a four-method protocol (ANCOVA, Propensity Score Matching, Difference-in-Differences, mixed-effects). All four methods converged on consensus effect sizes of d = 0.66&amp;amp;ndash;0.89. IT-verified Tier 2&amp;amp;ndash;3 incidents declined by 48.9% (incidence-rate ratio [IRR] = 0.51, 95% CI [0.38, 0.68]); blinded phishing click-rates fell from 8.8% to 2.1% (&amp;amp;chi;2(1) = 8.74, p = 0.003). Bootstrapped mediation analysis (PROCESS Model 4; 5000 draws) indicated that coping self-efficacy and perceived behavioural control&amp;amp;mdash;but not threat appraisal&amp;amp;mdash;were jointly associated with 66.4% of the total compliance effect. Rosenbaum bounds &amp;amp;Gamma; = 2.1; E-values &amp;amp;ge; 3.4. The findings are consistent with the hypothesis that AI-adaptive cybersecurity training produces robust, theoretically explicable benefits and that the coping-appraisal pathway, not threat salience, is the active psychological mechanism. The four-method triangulation framework offers a replicable standard for field evaluations with non-random assignment. the consensus envelope d = 0.66&amp;amp;ndash;0.89 is the observed range of point estimates across the four estimators; per-method 95% CIs are reported below indirect effect via coping self-efficacy = 0.843 [0.52, 1.19], via PBC = 0.524 [0.28, 0.81], via threat appraisal = 0.059 [&amp;amp;minus;0.07, 0.21] (ns); direct effect c&amp;amp;rsquo; = 0.63 (p = 0.026); total effect c = 2.06 [1.58, 2.54].</description>
	<pubDate>2026-07-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 682: Addressing Extreme Baseline Imbalances in Quasi-Experimental Evaluation of AI-Driven Adaptive Cybersecurity Training: A Multi-Method Approach</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/682">doi: 10.3390/info17070682</a></p>
	<p>Authors:
		Mohammed M. Al-Gawda
		Majdi Abdellatief
		Ibrahim Al-Baltah
		</p>
	<p>Despite widespread adoption of cybersecurity awareness training (CSAT), a persistent knowledge&amp;amp;ndash;behaviour gap continues to undermine organisational security posture, particularly in resource-constrained and developing-country contexts. This 12-week quasi-experimental field study evaluated an AI-adaptive CSAT platform against traditional instructor-led training (ILT) across three Yemeni organisations (total N = 187; AI-Adaptive: n = 94; Control: n = 93). The system used a 4-parameter Bayesian Knowledge Tracing (BKT) engine&amp;amp;mdash;with interpretable guess and slip signals&amp;amp;mdash;as an auditable pedagogical decision layer that triggered Protection Motivation Theory (PMT) and Theory of Planned Behavior (TPB)-aligned interventions. Extreme baseline imbalances (Cohen&amp;amp;rsquo;s d &amp;amp;gt; 2.0), at which standard ANCOVA residual adjustment alone is known to be biased and which necessitated advanced causal-inference triangulation, were addressed via a four-method protocol (ANCOVA, Propensity Score Matching, Difference-in-Differences, mixed-effects). All four methods converged on consensus effect sizes of d = 0.66&amp;amp;ndash;0.89. IT-verified Tier 2&amp;amp;ndash;3 incidents declined by 48.9% (incidence-rate ratio [IRR] = 0.51, 95% CI [0.38, 0.68]); blinded phishing click-rates fell from 8.8% to 2.1% (&amp;amp;chi;2(1) = 8.74, p = 0.003). Bootstrapped mediation analysis (PROCESS Model 4; 5000 draws) indicated that coping self-efficacy and perceived behavioural control&amp;amp;mdash;but not threat appraisal&amp;amp;mdash;were jointly associated with 66.4% of the total compliance effect. Rosenbaum bounds &amp;amp;Gamma; = 2.1; E-values &amp;amp;ge; 3.4. The findings are consistent with the hypothesis that AI-adaptive cybersecurity training produces robust, theoretically explicable benefits and that the coping-appraisal pathway, not threat salience, is the active psychological mechanism. The four-method triangulation framework offers a replicable standard for field evaluations with non-random assignment. the consensus envelope d = 0.66&amp;amp;ndash;0.89 is the observed range of point estimates across the four estimators; per-method 95% CIs are reported below indirect effect via coping self-efficacy = 0.843 [0.52, 1.19], via PBC = 0.524 [0.28, 0.81], via threat appraisal = 0.059 [&amp;amp;minus;0.07, 0.21] (ns); direct effect c&amp;amp;rsquo; = 0.63 (p = 0.026); total effect c = 2.06 [1.58, 2.54].</p>
	]]></content:encoded>

	<dc:title>Addressing Extreme Baseline Imbalances in Quasi-Experimental Evaluation of AI-Driven Adaptive Cybersecurity Training: A Multi-Method Approach</dc:title>
			<dc:creator>Mohammed M. Al-Gawda</dc:creator>
			<dc:creator>Majdi Abdellatief</dc:creator>
			<dc:creator>Ibrahim Al-Baltah</dc:creator>
		<dc:identifier>doi: 10.3390/info17070682</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>682</prism:startingPage>
		<prism:doi>10.3390/info17070682</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/682</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/681">

	<title>Information, Vol. 17, Pages 681: Navigating the Digitization Gap: An Indirect Evidence Synthesis of AI Methods for Low-Resource Chagatai Manuscripts</title>
	<link>https://www.mdpi.com/2078-2489/17/7/681</link>
	<description>Many historical handwritten records in low-resource languages remain difficult to access through modern digital systems. This limits efforts to preserve and study cultural heritage at scale. Chagatai manuscripts exemplify these challenges within the Eastern Turki tradition. For centuries, it served as a major written language across Central Asia and supported a rich literary tradition. Large collections of Chagatai manuscripts still survive today, yet only a small amount of this material exists in digital form. As the technical literature specifically focused on Chagatai-HTR remains in its nascent stage, this review synthesizes indirect evidence from taxonomically related Perso-Arabic scripts to establish a foundational research framework. This article presents a systematic literature review following the PRISMA guidelines to examine artificial intelligence methods for handwritten text recognition (HTR) and text restoration in low-resource languages. Analyzing 50 studies published between 2020 and 2026, the review categorizes research trends into handwritten text recognition (HTR), optical character recognition (OCR), script classification, dataset development, and multimodal vision&amp;amp;ndash;language systems. The findings reveal a significant architectural shift from traditional segmentation-based CNN and RNN models toward transformer architectures and multimodal approaches. However, for Chagatai specifically, the primary obstacle is not the lack of advanced models but a critical scarcity of basic research infrastructure, including expert-verified transcriptions, annotation standards, and open benchmark datasets. Consequently, this article proposes a concrete development roadmap focusing on systematic digitization, expert annotation, transfer learning, and the creation of baseline models to enable reproducible evaluations.</description>
	<pubDate>2026-07-14</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 681: Navigating the Digitization Gap: An Indirect Evidence Synthesis of AI Methods for Low-Resource Chagatai Manuscripts</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/681">doi: 10.3390/info17070681</a></p>
	<p>Authors:
		Zhanibek Balabayev
		Svitlana Biloshchytska
		Beibit Abdikenov
		Tomiris Zhaksylyk
		Birzhan Ayanbayev
		Dimash Rakishev
		</p>
	<p>Many historical handwritten records in low-resource languages remain difficult to access through modern digital systems. This limits efforts to preserve and study cultural heritage at scale. Chagatai manuscripts exemplify these challenges within the Eastern Turki tradition. For centuries, it served as a major written language across Central Asia and supported a rich literary tradition. Large collections of Chagatai manuscripts still survive today, yet only a small amount of this material exists in digital form. As the technical literature specifically focused on Chagatai-HTR remains in its nascent stage, this review synthesizes indirect evidence from taxonomically related Perso-Arabic scripts to establish a foundational research framework. This article presents a systematic literature review following the PRISMA guidelines to examine artificial intelligence methods for handwritten text recognition (HTR) and text restoration in low-resource languages. Analyzing 50 studies published between 2020 and 2026, the review categorizes research trends into handwritten text recognition (HTR), optical character recognition (OCR), script classification, dataset development, and multimodal vision&amp;amp;ndash;language systems. The findings reveal a significant architectural shift from traditional segmentation-based CNN and RNN models toward transformer architectures and multimodal approaches. However, for Chagatai specifically, the primary obstacle is not the lack of advanced models but a critical scarcity of basic research infrastructure, including expert-verified transcriptions, annotation standards, and open benchmark datasets. Consequently, this article proposes a concrete development roadmap focusing on systematic digitization, expert annotation, transfer learning, and the creation of baseline models to enable reproducible evaluations.</p>
	]]></content:encoded>

	<dc:title>Navigating the Digitization Gap: An Indirect Evidence Synthesis of AI Methods for Low-Resource Chagatai Manuscripts</dc:title>
			<dc:creator>Zhanibek Balabayev</dc:creator>
			<dc:creator>Svitlana Biloshchytska</dc:creator>
			<dc:creator>Beibit Abdikenov</dc:creator>
			<dc:creator>Tomiris Zhaksylyk</dc:creator>
			<dc:creator>Birzhan Ayanbayev</dc:creator>
			<dc:creator>Dimash Rakishev</dc:creator>
		<dc:identifier>doi: 10.3390/info17070681</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-14</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-14</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Systematic Review</prism:section>
	<prism:startingPage>681</prism:startingPage>
		<prism:doi>10.3390/info17070681</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/681</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/680">

	<title>Information, Vol. 17, Pages 680: A Hybrid Machine Learning and Survival Analysis Framework for Churn Prediction in the Telecom Sector</title>
	<link>https://www.mdpi.com/2078-2489/17/7/680</link>
	<description>Customer churn remains a significant concern in the telecommunications sector, leading to reduced profits and increased customer acquisition costs. The competitive nature of the industry allows customers the freedom to switch providers easily, necessitating effective models to predict and mitigate churn. This paper aimed to develop and compare optimal hybrid models for accurately predicting customer churn within a specified timeframe and to assess how various factors influence the time until churn. To achieve this, a dataset from an Iranian telecommunications company was utilised. The methodology involved a three-stage hybrid approach: initially, customers were segmented using K-means (KM) and Agglomerative clustering (AC) techniques. Subsequently, binary classification was performed using Logistic Regression (LR), Artificial Neural Networks (ANN), and Decision Trees (DT). Finally, the Cox proportional hazard model (CoxPH) was employed to estimate hazard rates and analyse the impact of covariates on churn time. Model performance was evaluated using metrics such as Accuracy, Precision, Recall, F1-Score, Specificity, and Area Under the Receiver Operating Characteristic Curve (AUC-ROC). The experimental results demonstrated that hybrid models generally outperformed individual Cox models across most predictive performance metrics. Specifically, the K-means + Logistic Regression + Cox (KM + LR + Cox) model was identified as the best performer, achieving an Accuracy of 88.24%, Precision of 93.18%, Specificity of 63.64%, and an F1-score of 93.01%. KM with two clusters (representing churners and non-churners) was optimal for customer segmentation. Covariate analysis revealed that factors such as &amp;amp;lsquo;Cluster 1&amp;amp;rsquo; decreased survival length, suggesting that customers in &amp;amp;lsquo;Cluster 2&amp;amp;rsquo; are more prone to churn. This paper successfully developed an optimal three-stage hybrid model, KM + LR + Cox, which effectively predicts customer churn and identifies key factors influencing churn duration, offering valuable insights for targeted retention strategies.</description>
	<pubDate>2026-07-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 680: A Hybrid Machine Learning and Survival Analysis Framework for Churn Prediction in the Telecom Sector</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/680">doi: 10.3390/info17070680</a></p>
	<p>Authors:
		Farai Fredric Mlambo
		Mpho Musuphi
		Kopano Letsela
		</p>
	<p>Customer churn remains a significant concern in the telecommunications sector, leading to reduced profits and increased customer acquisition costs. The competitive nature of the industry allows customers the freedom to switch providers easily, necessitating effective models to predict and mitigate churn. This paper aimed to develop and compare optimal hybrid models for accurately predicting customer churn within a specified timeframe and to assess how various factors influence the time until churn. To achieve this, a dataset from an Iranian telecommunications company was utilised. The methodology involved a three-stage hybrid approach: initially, customers were segmented using K-means (KM) and Agglomerative clustering (AC) techniques. Subsequently, binary classification was performed using Logistic Regression (LR), Artificial Neural Networks (ANN), and Decision Trees (DT). Finally, the Cox proportional hazard model (CoxPH) was employed to estimate hazard rates and analyse the impact of covariates on churn time. Model performance was evaluated using metrics such as Accuracy, Precision, Recall, F1-Score, Specificity, and Area Under the Receiver Operating Characteristic Curve (AUC-ROC). The experimental results demonstrated that hybrid models generally outperformed individual Cox models across most predictive performance metrics. Specifically, the K-means + Logistic Regression + Cox (KM + LR + Cox) model was identified as the best performer, achieving an Accuracy of 88.24%, Precision of 93.18%, Specificity of 63.64%, and an F1-score of 93.01%. KM with two clusters (representing churners and non-churners) was optimal for customer segmentation. Covariate analysis revealed that factors such as &amp;amp;lsquo;Cluster 1&amp;amp;rsquo; decreased survival length, suggesting that customers in &amp;amp;lsquo;Cluster 2&amp;amp;rsquo; are more prone to churn. This paper successfully developed an optimal three-stage hybrid model, KM + LR + Cox, which effectively predicts customer churn and identifies key factors influencing churn duration, offering valuable insights for targeted retention strategies.</p>
	]]></content:encoded>

	<dc:title>A Hybrid Machine Learning and Survival Analysis Framework for Churn Prediction in the Telecom Sector</dc:title>
			<dc:creator>Farai Fredric Mlambo</dc:creator>
			<dc:creator>Mpho Musuphi</dc:creator>
			<dc:creator>Kopano Letsela</dc:creator>
		<dc:identifier>doi: 10.3390/info17070680</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>680</prism:startingPage>
		<prism:doi>10.3390/info17070680</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/680</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/678">

	<title>Information, Vol. 17, Pages 678: User Experience, Narrative Continuity, and Monetization in Interactive Full-Motion Video Games: Evidence from Steam User Reviews</title>
	<link>https://www.mdpi.com/2078-2489/17/7/678</link>
	<description>Although monetization has been widely discussed in digital games, less attention has been paid to how it is discussed in narrative-centered Interactive Full-Motion Video (FMV) Games, where user experience depends heavily on continuity, completeness, and emotional engagement. Addressing this gap, this study analyzes 8676 Steam user reviews of Road to Empress I using NLP-based preprocessing, semantic analysis, sentiment analysis, and LDA topic modeling. The results indicate that the review corpus was organized around several interconnected dimensions, including narrative progression, character engagement, audiovisual performance, interactivity, and payment structure, with narrative-related concerns occupying a central position. Compared with the full corpus, the identified monetization-related review subset showed a less positive sentiment distribution, suggesting that monetization-related discussion within this subset was associated with more negative evaluations. Topic modeling further indicated three prominent concerns: interrupted narrative continuity, perceived incompleteness, and dissatisfaction with value for money. Overall, the findings suggest that, within the identified subset, monetization was discussed not merely as a pricing issue, but as part of the broader experiential structure through which continuity, completeness, and value were judged. The study contributes to research on Interactive FMV Games by foregrounding monetization as an experiential dimension and offers practical implications for designing less disruptive monetization strategies in narrative-centered interactive products.</description>
	<pubDate>2026-07-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 678: User Experience, Narrative Continuity, and Monetization in Interactive Full-Motion Video Games: Evidence from Steam User Reviews</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/678">doi: 10.3390/info17070678</a></p>
	<p>Authors:
		Minling Zeng
		Wenfeng Liu
		Yanling Zheng
		</p>
	<p>Although monetization has been widely discussed in digital games, less attention has been paid to how it is discussed in narrative-centered Interactive Full-Motion Video (FMV) Games, where user experience depends heavily on continuity, completeness, and emotional engagement. Addressing this gap, this study analyzes 8676 Steam user reviews of Road to Empress I using NLP-based preprocessing, semantic analysis, sentiment analysis, and LDA topic modeling. The results indicate that the review corpus was organized around several interconnected dimensions, including narrative progression, character engagement, audiovisual performance, interactivity, and payment structure, with narrative-related concerns occupying a central position. Compared with the full corpus, the identified monetization-related review subset showed a less positive sentiment distribution, suggesting that monetization-related discussion within this subset was associated with more negative evaluations. Topic modeling further indicated three prominent concerns: interrupted narrative continuity, perceived incompleteness, and dissatisfaction with value for money. Overall, the findings suggest that, within the identified subset, monetization was discussed not merely as a pricing issue, but as part of the broader experiential structure through which continuity, completeness, and value were judged. The study contributes to research on Interactive FMV Games by foregrounding monetization as an experiential dimension and offers practical implications for designing less disruptive monetization strategies in narrative-centered interactive products.</p>
	]]></content:encoded>

	<dc:title>User Experience, Narrative Continuity, and Monetization in Interactive Full-Motion Video Games: Evidence from Steam User Reviews</dc:title>
			<dc:creator>Minling Zeng</dc:creator>
			<dc:creator>Wenfeng Liu</dc:creator>
			<dc:creator>Yanling Zheng</dc:creator>
		<dc:identifier>doi: 10.3390/info17070678</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>678</prism:startingPage>
		<prism:doi>10.3390/info17070678</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/678</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/679">

	<title>Information, Vol. 17, Pages 679: Addressing Data Protection Impact Assessment (DPIA) Implementation Challenges in AI-Driven Digitalisation: A Systematic Review and PDCA-Based Governance Framework</title>
	<link>https://www.mdpi.com/2078-2489/17/7/679</link>
	<description>AI-driven digitalisation transforms how organisations process personal data and introduces risks that traditional Data Protection Impact Assessment (DPIA) frameworks cannot adequately address. Automated decision-making and large-scale processing in AI, IoT, big data analytics, and blockchain environments create privacy concerns beyond the scope of existing DPIA methodologies. The EU AI Act extends this scope through the Fundamental Rights Impact Assessment (FRIA) under Article 27, which links data protection obligations to broader fundamental rights governance. This study addresses these gaps through a two-phase research design. Phase 1 conducts a systematic literature review of 25 studies and applies framework analysis to identify DPIA implementation challenges across four categories: legal and regulatory, risk assessment, scope, and complexity. AI-specific challenges appear across all four categories. Phase 2 develops a governance framework built on the Plan-Do-Check-Act (PDCA) cycle and organised through a four-level hierarchy of Lifecycle Phase, Risk Management Domain, Control Objective, and Operational Activity. The framework translates relevant requirements of ISO 31000:2018, ISO/IEC 27701:2025, and ISO/IEC 29134:2023 into traceable activities and encompasses algorithmic fairness and socio-ethical impacts. The actionable DPIA framework supports compliance with the GDPR, the EU AI Act and the three ISO standards and will be of interest to company practitioners and other researchers investigating the theoretical and practice-based aspects of digitalisation and data privacy.</description>
	<pubDate>2026-07-13</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 679: Addressing Data Protection Impact Assessment (DPIA) Implementation Challenges in AI-Driven Digitalisation: A Systematic Review and PDCA-Based Governance Framework</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/679">doi: 10.3390/info17070679</a></p>
	<p>Authors:
		Bilgin Metin
		Nazlı Elif Yey
		Martin Wynn
		</p>
	<p>AI-driven digitalisation transforms how organisations process personal data and introduces risks that traditional Data Protection Impact Assessment (DPIA) frameworks cannot adequately address. Automated decision-making and large-scale processing in AI, IoT, big data analytics, and blockchain environments create privacy concerns beyond the scope of existing DPIA methodologies. The EU AI Act extends this scope through the Fundamental Rights Impact Assessment (FRIA) under Article 27, which links data protection obligations to broader fundamental rights governance. This study addresses these gaps through a two-phase research design. Phase 1 conducts a systematic literature review of 25 studies and applies framework analysis to identify DPIA implementation challenges across four categories: legal and regulatory, risk assessment, scope, and complexity. AI-specific challenges appear across all four categories. Phase 2 develops a governance framework built on the Plan-Do-Check-Act (PDCA) cycle and organised through a four-level hierarchy of Lifecycle Phase, Risk Management Domain, Control Objective, and Operational Activity. The framework translates relevant requirements of ISO 31000:2018, ISO/IEC 27701:2025, and ISO/IEC 29134:2023 into traceable activities and encompasses algorithmic fairness and socio-ethical impacts. The actionable DPIA framework supports compliance with the GDPR, the EU AI Act and the three ISO standards and will be of interest to company practitioners and other researchers investigating the theoretical and practice-based aspects of digitalisation and data privacy.</p>
	]]></content:encoded>

	<dc:title>Addressing Data Protection Impact Assessment (DPIA) Implementation Challenges in AI-Driven Digitalisation: A Systematic Review and PDCA-Based Governance Framework</dc:title>
			<dc:creator>Bilgin Metin</dc:creator>
			<dc:creator>Nazlı Elif Yey</dc:creator>
			<dc:creator>Martin Wynn</dc:creator>
		<dc:identifier>doi: 10.3390/info17070679</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-13</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-13</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>679</prism:startingPage>
		<prism:doi>10.3390/info17070679</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/679</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/677">

	<title>Information, Vol. 17, Pages 677: Determinants of Higher Education Learners&amp;rsquo; Behavioral Intention Toward Generative AI Tools: A Hybrid SEM&amp;ndash;Machine Learning Approach</title>
	<link>https://www.mdpi.com/2078-2489/17/7/677</link>
	<description>As generative artificial intelligence (GenAI) increasingly permeates educational contexts, understanding the factors driving learners&amp;amp;rsquo; Behavioral Intention (BI) toward GenAI-powered tools has become critical. This study integrates the Technology Acceptance Model (TAM), the Task-Technology Fit (TTF) framework, and privacy and ethical risk considerations to explore the determinants of Chinese higher education students&amp;amp;rsquo; Behavioral Intention to adopt these tools. Data were collected from 716 students via a structured self-reported questionnaire. A multi-stage analytical approach was employed by integrating structural equation modeling (SEM) with artificial neural networks (ANN) and support vector regression (SVR). SEM was first utilized to validate the theoretical hypotheses and the measurement model. Subsequently, ANN and SVR models were constructed to explore non-linear relationships and rank the importance of core predictors for Behavioral Intention, including Perceived Ease of Use (PEU), Privacy and Ethical Concerns (PEC), Perceived Technical Features (PTF), and TTF. The modeling performance of the two algorithms was then rigorously compared. The SEM results indicate that PTF exerts an indirect impact on Behavioral Intention via the sequential mediation of Task-Technology Fit and Perceived Usefulness (PU), while PEU positively influences both Perceived Usefulness and Behavioral Intention. Notably, PEC did not exhibit a significant negative effect on users&amp;amp;rsquo; Attitude (ATT) or Behavioral Intention. These findings were further elucidated by the machine learning analyses, where PTF and PEU emerged as the dominant predictors, whereas the non-linear contribution of PEC was marginal. Furthermore, SVR outperformed ANN in terms of predictive accuracy and model stability. This study demonstrates the efficacy of combining theoretical modeling with machine learning techniques to elucidate the adoption mechanisms of GenAI in higher education. In addition, preliminary teaching observations in undergraduate mathematics and logistics management courses link quantitative results with actual learning scenarios. We acknowledge that future research should validate these patterns using observed behavioral data.</description>
	<pubDate>2026-07-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 677: Determinants of Higher Education Learners&amp;rsquo; Behavioral Intention Toward Generative AI Tools: A Hybrid SEM&amp;ndash;Machine Learning Approach</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/677">doi: 10.3390/info17070677</a></p>
	<p>Authors:
		Shanshan Peng
		Fang Zhu
		</p>
	<p>As generative artificial intelligence (GenAI) increasingly permeates educational contexts, understanding the factors driving learners&amp;amp;rsquo; Behavioral Intention (BI) toward GenAI-powered tools has become critical. This study integrates the Technology Acceptance Model (TAM), the Task-Technology Fit (TTF) framework, and privacy and ethical risk considerations to explore the determinants of Chinese higher education students&amp;amp;rsquo; Behavioral Intention to adopt these tools. Data were collected from 716 students via a structured self-reported questionnaire. A multi-stage analytical approach was employed by integrating structural equation modeling (SEM) with artificial neural networks (ANN) and support vector regression (SVR). SEM was first utilized to validate the theoretical hypotheses and the measurement model. Subsequently, ANN and SVR models were constructed to explore non-linear relationships and rank the importance of core predictors for Behavioral Intention, including Perceived Ease of Use (PEU), Privacy and Ethical Concerns (PEC), Perceived Technical Features (PTF), and TTF. The modeling performance of the two algorithms was then rigorously compared. The SEM results indicate that PTF exerts an indirect impact on Behavioral Intention via the sequential mediation of Task-Technology Fit and Perceived Usefulness (PU), while PEU positively influences both Perceived Usefulness and Behavioral Intention. Notably, PEC did not exhibit a significant negative effect on users&amp;amp;rsquo; Attitude (ATT) or Behavioral Intention. These findings were further elucidated by the machine learning analyses, where PTF and PEU emerged as the dominant predictors, whereas the non-linear contribution of PEC was marginal. Furthermore, SVR outperformed ANN in terms of predictive accuracy and model stability. This study demonstrates the efficacy of combining theoretical modeling with machine learning techniques to elucidate the adoption mechanisms of GenAI in higher education. In addition, preliminary teaching observations in undergraduate mathematics and logistics management courses link quantitative results with actual learning scenarios. We acknowledge that future research should validate these patterns using observed behavioral data.</p>
	]]></content:encoded>

	<dc:title>Determinants of Higher Education Learners&amp;amp;rsquo; Behavioral Intention Toward Generative AI Tools: A Hybrid SEM&amp;amp;ndash;Machine Learning Approach</dc:title>
			<dc:creator>Shanshan Peng</dc:creator>
			<dc:creator>Fang Zhu</dc:creator>
		<dc:identifier>doi: 10.3390/info17070677</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>677</prism:startingPage>
		<prism:doi>10.3390/info17070677</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/677</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/676">

	<title>Information, Vol. 17, Pages 676: IntelligentVehicle Security: Real-Time Anomaly Detection and Anti-Theft Surveillance Using Monocular Depth Estimation and Behavioral Analysis</title>
	<link>https://www.mdpi.com/2078-2489/17/7/676</link>
	<description>Vehicle theft and vandalism remain significant urban security challenges commonly addressed through reactive, post-incident forensic measures. This paper proposes a proactive, real-time computer vision system designed to detect potentially suspicious behavior around parked vehicles, with a specific focus on unauthorized proximity and loitering. The proposed architecture integrates state-of-the-art object detection using YOLOv11 (You Only Look Once version 11), multi-object tracking via a lightweight custom association tracker inspired by the ByteTrack/StrongSORT/OC-SORT paradigm, and monocular depth estimation based on the Intel DPT-Large framework.A key contribution is the identification and mitigation of the Perspective Challenge: the two-dimensional (2D) scale ambiguity that causes distant background pedestrians to appear falsely proximate to foreground vehicles in monocular camera feeds. To address this, three spatial analysis strategies are implemented and evaluated: (A) fixed Euclidean thresholding, (B) adaptive perspective thresholding, and (C) three-dimensional (3D) depth injection. Experimental results on real-world urban surveillance footage (27,000 annotated frames across two datasets) demonstrate that Strategy C achieves the highest precision (0.95) with an F1-score of 0.92, while Strategy B provides the best balance between accuracy (precision 0.88, recall 0.91, F1 0.89) and computational efficiency (32.7 frames per second, FPS). Compared to naive 2D thresholding (Strategy A), Strategy B reduces false alarms by approximately 80%, while Strategy C further improves precision to 0.95 through depth-plane verification. The system maintains real-time performance exceeding 30 FPS under Strategy B, making it a strong candidate for practical urban vehicle monitoring, subject to further large-scale validation across diverse environments.</description>
	<pubDate>2026-07-12</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 676: IntelligentVehicle Security: Real-Time Anomaly Detection and Anti-Theft Surveillance Using Monocular Depth Estimation and Behavioral Analysis</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/676">doi: 10.3390/info17070676</a></p>
	<p>Authors:
		Umar Adeel
		Ammar Rashid
		Shafiz Affendi Bin Mohd Yusof
		Usman Javed Butt
		</p>
	<p>Vehicle theft and vandalism remain significant urban security challenges commonly addressed through reactive, post-incident forensic measures. This paper proposes a proactive, real-time computer vision system designed to detect potentially suspicious behavior around parked vehicles, with a specific focus on unauthorized proximity and loitering. The proposed architecture integrates state-of-the-art object detection using YOLOv11 (You Only Look Once version 11), multi-object tracking via a lightweight custom association tracker inspired by the ByteTrack/StrongSORT/OC-SORT paradigm, and monocular depth estimation based on the Intel DPT-Large framework.A key contribution is the identification and mitigation of the Perspective Challenge: the two-dimensional (2D) scale ambiguity that causes distant background pedestrians to appear falsely proximate to foreground vehicles in monocular camera feeds. To address this, three spatial analysis strategies are implemented and evaluated: (A) fixed Euclidean thresholding, (B) adaptive perspective thresholding, and (C) three-dimensional (3D) depth injection. Experimental results on real-world urban surveillance footage (27,000 annotated frames across two datasets) demonstrate that Strategy C achieves the highest precision (0.95) with an F1-score of 0.92, while Strategy B provides the best balance between accuracy (precision 0.88, recall 0.91, F1 0.89) and computational efficiency (32.7 frames per second, FPS). Compared to naive 2D thresholding (Strategy A), Strategy B reduces false alarms by approximately 80%, while Strategy C further improves precision to 0.95 through depth-plane verification. The system maintains real-time performance exceeding 30 FPS under Strategy B, making it a strong candidate for practical urban vehicle monitoring, subject to further large-scale validation across diverse environments.</p>
	]]></content:encoded>

	<dc:title>IntelligentVehicle Security: Real-Time Anomaly Detection and Anti-Theft Surveillance Using Monocular Depth Estimation and Behavioral Analysis</dc:title>
			<dc:creator>Umar Adeel</dc:creator>
			<dc:creator>Ammar Rashid</dc:creator>
			<dc:creator>Shafiz Affendi Bin Mohd Yusof</dc:creator>
			<dc:creator>Usman Javed Butt</dc:creator>
		<dc:identifier>doi: 10.3390/info17070676</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-12</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-12</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>676</prism:startingPage>
		<prism:doi>10.3390/info17070676</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/676</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/675">

	<title>Information, Vol. 17, Pages 675: AI&amp;ndash;Human Collaborative Interpretation (AHCI)&amp;mdash;A Methodological Framework for Human&amp;ndash;Machine Collaboration in the Visualisation and Aesthetic Evaluation of Complex Cultural Heritage</title>
	<link>https://www.mdpi.com/2078-2489/17/7/675</link>
	<description>This paper proposes the AI&amp;amp;ndash;Human Collaborative Interpretation (AHCI) human&amp;amp;ndash;machine collaboration methodological framework, offering a new research pathway for the digital interpretation of complex cultural heritage. The framework integrates multi-source data processing, formalised feature modelling, interpretable analysis and human&amp;amp;ndash;machine feedback mechanisms, translating the complex information of cultural heritage into an analysable and interactive structure. Building upon this, the Tianlai.China project serves as a case study for the multimodal data integration, aesthetic feature modelling and interactive visualisation of the Illustrated Catalogue of Famous Porcelains Through the Ages. The effectiveness of the collaborative mechanism is validated through expert&amp;amp;ndash;public&amp;amp;ndash;AI comparative experiments and human&amp;amp;ndash;AI feedback loop experiments. The main contributions of this paper include: proposing a methodological framework for human&amp;amp;ndash;machine collaboration in cultural heritage value assessment; constructing an interpretable formalised model of cultural features and a corresponding visualisation system; analysing the impact of AI explanations on expert cognition through empirical research; and exploring the transferability of this framework across different types of cultural heritage. Against this backdrop, the human&amp;amp;ndash;machine collaboration system developed by AHCI&amp;amp;mdash;comprising &amp;amp;lsquo;data semantics&amp;amp;ndash;feature modelling&amp;amp;ndash;visual output&amp;amp;ndash;cognitive feedback&amp;amp;rsquo;&amp;amp;mdash;possesses cross-domain applicability.</description>
	<pubDate>2026-07-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 675: AI&amp;ndash;Human Collaborative Interpretation (AHCI)&amp;mdash;A Methodological Framework for Human&amp;ndash;Machine Collaboration in the Visualisation and Aesthetic Evaluation of Complex Cultural Heritage</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/675">doi: 10.3390/info17070675</a></p>
	<p>Authors:
		Liwen Zhang
		Yiqi Liu
		Jingya Li
		Yuexi Dong
		</p>
	<p>This paper proposes the AI&amp;amp;ndash;Human Collaborative Interpretation (AHCI) human&amp;amp;ndash;machine collaboration methodological framework, offering a new research pathway for the digital interpretation of complex cultural heritage. The framework integrates multi-source data processing, formalised feature modelling, interpretable analysis and human&amp;amp;ndash;machine feedback mechanisms, translating the complex information of cultural heritage into an analysable and interactive structure. Building upon this, the Tianlai.China project serves as a case study for the multimodal data integration, aesthetic feature modelling and interactive visualisation of the Illustrated Catalogue of Famous Porcelains Through the Ages. The effectiveness of the collaborative mechanism is validated through expert&amp;amp;ndash;public&amp;amp;ndash;AI comparative experiments and human&amp;amp;ndash;AI feedback loop experiments. The main contributions of this paper include: proposing a methodological framework for human&amp;amp;ndash;machine collaboration in cultural heritage value assessment; constructing an interpretable formalised model of cultural features and a corresponding visualisation system; analysing the impact of AI explanations on expert cognition through empirical research; and exploring the transferability of this framework across different types of cultural heritage. Against this backdrop, the human&amp;amp;ndash;machine collaboration system developed by AHCI&amp;amp;mdash;comprising &amp;amp;lsquo;data semantics&amp;amp;ndash;feature modelling&amp;amp;ndash;visual output&amp;amp;ndash;cognitive feedback&amp;amp;rsquo;&amp;amp;mdash;possesses cross-domain applicability.</p>
	]]></content:encoded>

	<dc:title>AI&amp;amp;ndash;Human Collaborative Interpretation (AHCI)&amp;amp;mdash;A Methodological Framework for Human&amp;amp;ndash;Machine Collaboration in the Visualisation and Aesthetic Evaluation of Complex Cultural Heritage</dc:title>
			<dc:creator>Liwen Zhang</dc:creator>
			<dc:creator>Yiqi Liu</dc:creator>
			<dc:creator>Jingya Li</dc:creator>
			<dc:creator>Yuexi Dong</dc:creator>
		<dc:identifier>doi: 10.3390/info17070675</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>675</prism:startingPage>
		<prism:doi>10.3390/info17070675</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/675</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/674">

	<title>Information, Vol. 17, Pages 674: A Multi-Objective Scoring Approach to Contract and Exposure-Aware Re-Ranking in Real-Estate Recommendation</title>
	<link>https://www.mdpi.com/2078-2489/17/7/674</link>
	<description>Large online marketplaces increasingly rely on multi-stage ranking pipelines where a learned relevance model is complemented by business-aware constraints such as contractual pacing, exposure caps and commercial alignment objectives. This paper develops a second-stage, contract-aware re-ranking layer for real-estate recommendation that explicitly balances user&amp;amp;ndash;item relevance with plan fulfillment, lead value and operational guardrails. The proposed multi-objective re-ranker (PMOR) combines a calibrated base relevance score with multiplicative business adjustments and subtractive penalties for approaching contractual caps and for within-slate similarity. The method supports heterogeneous settlement models, including pay-per-action and fixed-fee contracts, via contract-specific weights. Because the scoring function is deterministic and structured, it admits exact component-wise contribution analysis and counterfactual ablations without relying on surrogate explainability methods. Offline evaluation on production logs from an anonymized marketplace covers 4219 recommendation requests and 184,147 candidate items, joined with daily business snapshots using an as-of strategy to prevent look-ahead bias. Under a profit proxy based on effective lead value, position discounting and billability, PMOR achieves an indexed expected-revenue proxy of 487.4 (baseline = 100), corresponding to a lift of 387.4% over a model-only baseline and 48.4% over a legacy production re-ranker (LPR). The gain is primarily associated with improved billable exposure, increasing the share of billable positions in TOP-3 to 78.22% compared with 37.85% for LPR. We discuss parameter sensitivity, operational considerations and limitations of offline proxy objectives for deployment.</description>
	<pubDate>2026-07-11</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 674: A Multi-Objective Scoring Approach to Contract and Exposure-Aware Re-Ranking in Real-Estate Recommendation</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/674">doi: 10.3390/info17070674</a></p>
	<p>Authors:
		Bogdan Arct
		Mateusz Bieniek
		Bartłomiej Kanabus
		Aleksander Kozłowski
		Piotr Wetmański
		Michał Kruk
		Sylwia Stachowiak
		Jarosław Kurek
		</p>
	<p>Large online marketplaces increasingly rely on multi-stage ranking pipelines where a learned relevance model is complemented by business-aware constraints such as contractual pacing, exposure caps and commercial alignment objectives. This paper develops a second-stage, contract-aware re-ranking layer for real-estate recommendation that explicitly balances user&amp;amp;ndash;item relevance with plan fulfillment, lead value and operational guardrails. The proposed multi-objective re-ranker (PMOR) combines a calibrated base relevance score with multiplicative business adjustments and subtractive penalties for approaching contractual caps and for within-slate similarity. The method supports heterogeneous settlement models, including pay-per-action and fixed-fee contracts, via contract-specific weights. Because the scoring function is deterministic and structured, it admits exact component-wise contribution analysis and counterfactual ablations without relying on surrogate explainability methods. Offline evaluation on production logs from an anonymized marketplace covers 4219 recommendation requests and 184,147 candidate items, joined with daily business snapshots using an as-of strategy to prevent look-ahead bias. Under a profit proxy based on effective lead value, position discounting and billability, PMOR achieves an indexed expected-revenue proxy of 487.4 (baseline = 100), corresponding to a lift of 387.4% over a model-only baseline and 48.4% over a legacy production re-ranker (LPR). The gain is primarily associated with improved billable exposure, increasing the share of billable positions in TOP-3 to 78.22% compared with 37.85% for LPR. We discuss parameter sensitivity, operational considerations and limitations of offline proxy objectives for deployment.</p>
	]]></content:encoded>

	<dc:title>A Multi-Objective Scoring Approach to Contract and Exposure-Aware Re-Ranking in Real-Estate Recommendation</dc:title>
			<dc:creator>Bogdan Arct</dc:creator>
			<dc:creator>Mateusz Bieniek</dc:creator>
			<dc:creator>Bartłomiej Kanabus</dc:creator>
			<dc:creator>Aleksander Kozłowski</dc:creator>
			<dc:creator>Piotr Wetmański</dc:creator>
			<dc:creator>Michał Kruk</dc:creator>
			<dc:creator>Sylwia Stachowiak</dc:creator>
			<dc:creator>Jarosław Kurek</dc:creator>
		<dc:identifier>doi: 10.3390/info17070674</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-11</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-11</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>674</prism:startingPage>
		<prism:doi>10.3390/info17070674</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/674</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/673">

	<title>Information, Vol. 17, Pages 673: WID-YOLO11: Weld Surface Defect Detection via Frequency-Domain Feature Decomposition and Multi-Scale Dilated Attention</title>
	<link>https://www.mdpi.com/2078-2489/17/7/673</link>
	<description>Weld defect detection is challenged by significant variations in defect scale, complex defect morphology, and strong background interference. To address these issues, this study proposes WID-YOLO11, an improved detection model based on YOLO11n. First, a novel C3k2_LFA-WTConv module is developed to decompose feature maps into frequency subbands via learnable wavelet filters and adaptively reweight them through a Learnable Frequency-Attention (LFA) mechanism, enabling the network to learn task-adapted subband representations for different defect types, where each class exhibits distinct wavelet subband energy distributions. Second, an Improved Multi-Scale Dilated Local Attention (IMSDA) module is constructed by extending the dilation-rate set of the original MSDA from three to four values (1, 2, 3, and 4), expanding the maximum equivalent receptive field from 7 &amp;amp;times; 7 to 9 &amp;amp;times; 9 to improve multi-scale sensitivity to medium-scale defects such as porosity and spatter at low computational overhead. Finally, a DySample dynamic upsampling module is integrated into the neck network to adaptively learn sampling locations and preserve defect boundary details more effectively during multi-scale feature fusion. Evaluations on a publicly available weld defect dataset of 986 images show that WID-YOLO11 outperforms the YOLO11n baseline by 4.5, 10.4, and 3.4 percentage points in mAP@0.5, Recall, and mAP@0.5:0.95, respectively, confirming the effectiveness of the three proposed enhancements.</description>
	<pubDate>2026-07-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 673: WID-YOLO11: Weld Surface Defect Detection via Frequency-Domain Feature Decomposition and Multi-Scale Dilated Attention</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/673">doi: 10.3390/info17070673</a></p>
	<p>Authors:
		Zhiyuan Li
		Songsong Li
		Weining Li
		Meide Liu
		Shidong Li
		Xiaoming Chen
		</p>
	<p>Weld defect detection is challenged by significant variations in defect scale, complex defect morphology, and strong background interference. To address these issues, this study proposes WID-YOLO11, an improved detection model based on YOLO11n. First, a novel C3k2_LFA-WTConv module is developed to decompose feature maps into frequency subbands via learnable wavelet filters and adaptively reweight them through a Learnable Frequency-Attention (LFA) mechanism, enabling the network to learn task-adapted subband representations for different defect types, where each class exhibits distinct wavelet subband energy distributions. Second, an Improved Multi-Scale Dilated Local Attention (IMSDA) module is constructed by extending the dilation-rate set of the original MSDA from three to four values (1, 2, 3, and 4), expanding the maximum equivalent receptive field from 7 &amp;amp;times; 7 to 9 &amp;amp;times; 9 to improve multi-scale sensitivity to medium-scale defects such as porosity and spatter at low computational overhead. Finally, a DySample dynamic upsampling module is integrated into the neck network to adaptively learn sampling locations and preserve defect boundary details more effectively during multi-scale feature fusion. Evaluations on a publicly available weld defect dataset of 986 images show that WID-YOLO11 outperforms the YOLO11n baseline by 4.5, 10.4, and 3.4 percentage points in mAP@0.5, Recall, and mAP@0.5:0.95, respectively, confirming the effectiveness of the three proposed enhancements.</p>
	]]></content:encoded>

	<dc:title>WID-YOLO11: Weld Surface Defect Detection via Frequency-Domain Feature Decomposition and Multi-Scale Dilated Attention</dc:title>
			<dc:creator>Zhiyuan Li</dc:creator>
			<dc:creator>Songsong Li</dc:creator>
			<dc:creator>Weining Li</dc:creator>
			<dc:creator>Meide Liu</dc:creator>
			<dc:creator>Shidong Li</dc:creator>
			<dc:creator>Xiaoming Chen</dc:creator>
		<dc:identifier>doi: 10.3390/info17070673</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-10</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-10</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>673</prism:startingPage>
		<prism:doi>10.3390/info17070673</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/673</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/672">

	<title>Information, Vol. 17, Pages 672: Profiling Organizational AI Readiness in Thailand&amp;rsquo;s Logistics Industry Using TOE&amp;ndash;UTAUT Features, Clustering Analysis, and Explainable Machine Learning</title>
	<link>https://www.mdpi.com/2078-2489/17/7/672</link>
	<description>Artificial intelligence (AI) adoption within logistics organizations remains uneven despite increasing digital transformation initiatives in emerging economies. This study investigates respondent-perceived organizational AI readiness profiles in Thailand&amp;amp;rsquo;s logistics industry using an integrated analytical framework combining TOE&amp;amp;ndash;UTAUT predictors, clustering analysis, supervised machine learning, and explainable artificial intelligence techniques. Data were collected from 520 logistics and supply chain professionals in Thailand using a structured questionnaire. K-means clustering was applied to identify internally derived respondent-perceived AI readiness profiles, while Random Forest, Support Vector Machine (SVM), XGBoost, and LightGBM models were developed to classify readiness-profile membership. A weighted voting ensemble model was additionally employed to assess classification robustness and profile-differentiation stability across multiple learning algorithms. The findings identified three internally derived respondent-perceived AI readiness profiles representing relatively low, moderate, and advanced readiness patterns within the TOE&amp;amp;ndash;UTAUT feature space. Among the evaluated models, the SVM classifier achieved the strongest classification performance, obtaining the highest accuracy and AUC values. SHAP analysis indicated that Actual Use, Technological Factors, Facilitating Conditions, and Behavioral Intention exhibited the largest feature-attribution contributions within the readiness-profile classification framework. The study contributes to AI adoption research by integrating clustering-based segmentation, machine-learning classification, and explainable artificial intelligence into a unified readiness-profiling framework. The findings provide practical insights for managers and policymakers seeking to understand respondent-perceived organizational AI readiness patterns and support digital transformation initiatives within logistics professional contexts.</description>
	<pubDate>2026-07-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 672: Profiling Organizational AI Readiness in Thailand&amp;rsquo;s Logistics Industry Using TOE&amp;ndash;UTAUT Features, Clustering Analysis, and Explainable Machine Learning</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/672">doi: 10.3390/info17070672</a></p>
	<p>Authors:
		Wipada Sriwichien
		Warawut Narkbunnum
		Kittipol Wisaeng
		</p>
	<p>Artificial intelligence (AI) adoption within logistics organizations remains uneven despite increasing digital transformation initiatives in emerging economies. This study investigates respondent-perceived organizational AI readiness profiles in Thailand&amp;amp;rsquo;s logistics industry using an integrated analytical framework combining TOE&amp;amp;ndash;UTAUT predictors, clustering analysis, supervised machine learning, and explainable artificial intelligence techniques. Data were collected from 520 logistics and supply chain professionals in Thailand using a structured questionnaire. K-means clustering was applied to identify internally derived respondent-perceived AI readiness profiles, while Random Forest, Support Vector Machine (SVM), XGBoost, and LightGBM models were developed to classify readiness-profile membership. A weighted voting ensemble model was additionally employed to assess classification robustness and profile-differentiation stability across multiple learning algorithms. The findings identified three internally derived respondent-perceived AI readiness profiles representing relatively low, moderate, and advanced readiness patterns within the TOE&amp;amp;ndash;UTAUT feature space. Among the evaluated models, the SVM classifier achieved the strongest classification performance, obtaining the highest accuracy and AUC values. SHAP analysis indicated that Actual Use, Technological Factors, Facilitating Conditions, and Behavioral Intention exhibited the largest feature-attribution contributions within the readiness-profile classification framework. The study contributes to AI adoption research by integrating clustering-based segmentation, machine-learning classification, and explainable artificial intelligence into a unified readiness-profiling framework. The findings provide practical insights for managers and policymakers seeking to understand respondent-perceived organizational AI readiness patterns and support digital transformation initiatives within logistics professional contexts.</p>
	]]></content:encoded>

	<dc:title>Profiling Organizational AI Readiness in Thailand&amp;amp;rsquo;s Logistics Industry Using TOE&amp;amp;ndash;UTAUT Features, Clustering Analysis, and Explainable Machine Learning</dc:title>
			<dc:creator>Wipada Sriwichien</dc:creator>
			<dc:creator>Warawut Narkbunnum</dc:creator>
			<dc:creator>Kittipol Wisaeng</dc:creator>
		<dc:identifier>doi: 10.3390/info17070672</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-10</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-10</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>672</prism:startingPage>
		<prism:doi>10.3390/info17070672</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/672</prism:url>
	
	<cc:license rdf:resource="CC BY 4.0"/>
</item>
        <item rdf:about="https://www.mdpi.com/2078-2489/17/7/671">

	<title>Information, Vol. 17, Pages 671: CogMed: A Multi-Agent Legal Mediation Framework Fusing Cognitive Strategies and Dynamic Beliefs</title>
	<link>https://www.mdpi.com/2078-2489/17/7/671</link>
	<description>Legal mediation is an important mechanism for resolving social conflicts and handling disputes. It involves complex interpersonal interactions and unstructured decision-making processes, and therefore holds significant research value as a domain. Leveraging the outstanding logical reasoning capabilities of large language models, multi-agent systems for simulating complex social interactions have become a cutting-edge research direction in artificial intelligence, providing a new supporting vehicle and research pathway for the intelligent study and practical application of legal mediation. However, directly applying general-purpose multi-agent techniques or general-purpose, opaque LLMs to long-horizon, multi-party, and high-conflict professional mediation tasks exposes several deep-seated structural cognitive deficiencies, including a lack of process awareness, insufficient domain-specific intervention capabilities, and limited theory-of-mind reasoning. To address these challenges, this study proposes CogMed, a cognitively enhanced multi-agent framework for legal mediation simulation, which aims to compensate for the limitations of general models in professional strategic interactions through an explicit cognitive architecture. Rather than introducing entirely new individual reasoning modules, the proposed framework focuses on cognitively coordinated integration of process control, strategic intervention, and belief modeling mechanisms under legal mediation settings. CogMed models the mediation process as a Finite State Machine (FSM) to capture macro-level decision logic and introduces a Strategic Toolkit (STK) that serves as a set of action primitives for micro-level interventions. Meanwhile, a Dynamic Belief Tracking (DBT) mechanism is incorporated into party agents to simulate psychological anticipation and strategic reasoning during negotiation. Experimental results demonstrate that CogMed effectively improves both mediation success rates and the quality of negotiated outcomes. Furthermore, the findings suggest a preliminary framework-level compensation pattern under the current experimental setting, where cognitively structured coordination mechanisms may partially enhance the mediation capability of medium-scale models. These preliminary experimental observations suggest that cognitively structured coordination mechanisms may partially compensate for certain limitations associated with model scale under the current controlled mediation setting, thereby offering a potential research direction for cognitively structured legal mediation simulation systems under controlled experimental settings.</description>
	<pubDate>2026-07-10</pubDate>

	<content:encoded><![CDATA[
	<p><b>Information, Vol. 17, Pages 671: CogMed: A Multi-Agent Legal Mediation Framework Fusing Cognitive Strategies and Dynamic Beliefs</b></p>
	<p>Information <a href="https://www.mdpi.com/2078-2489/17/7/671">doi: 10.3390/info17070671</a></p>
	<p>Authors:
		Jia Chen
		Yiheng Ma
		Shijuan Gao
		</p>
	<p>Legal mediation is an important mechanism for resolving social conflicts and handling disputes. It involves complex interpersonal interactions and unstructured decision-making processes, and therefore holds significant research value as a domain. Leveraging the outstanding logical reasoning capabilities of large language models, multi-agent systems for simulating complex social interactions have become a cutting-edge research direction in artificial intelligence, providing a new supporting vehicle and research pathway for the intelligent study and practical application of legal mediation. However, directly applying general-purpose multi-agent techniques or general-purpose, opaque LLMs to long-horizon, multi-party, and high-conflict professional mediation tasks exposes several deep-seated structural cognitive deficiencies, including a lack of process awareness, insufficient domain-specific intervention capabilities, and limited theory-of-mind reasoning. To address these challenges, this study proposes CogMed, a cognitively enhanced multi-agent framework for legal mediation simulation, which aims to compensate for the limitations of general models in professional strategic interactions through an explicit cognitive architecture. Rather than introducing entirely new individual reasoning modules, the proposed framework focuses on cognitively coordinated integration of process control, strategic intervention, and belief modeling mechanisms under legal mediation settings. CogMed models the mediation process as a Finite State Machine (FSM) to capture macro-level decision logic and introduces a Strategic Toolkit (STK) that serves as a set of action primitives for micro-level interventions. Meanwhile, a Dynamic Belief Tracking (DBT) mechanism is incorporated into party agents to simulate psychological anticipation and strategic reasoning during negotiation. Experimental results demonstrate that CogMed effectively improves both mediation success rates and the quality of negotiated outcomes. Furthermore, the findings suggest a preliminary framework-level compensation pattern under the current experimental setting, where cognitively structured coordination mechanisms may partially enhance the mediation capability of medium-scale models. These preliminary experimental observations suggest that cognitively structured coordination mechanisms may partially compensate for certain limitations associated with model scale under the current controlled mediation setting, thereby offering a potential research direction for cognitively structured legal mediation simulation systems under controlled experimental settings.</p>
	]]></content:encoded>

	<dc:title>CogMed: A Multi-Agent Legal Mediation Framework Fusing Cognitive Strategies and Dynamic Beliefs</dc:title>
			<dc:creator>Jia Chen</dc:creator>
			<dc:creator>Yiheng Ma</dc:creator>
			<dc:creator>Shijuan Gao</dc:creator>
		<dc:identifier>doi: 10.3390/info17070671</dc:identifier>
	<dc:source>Information</dc:source>
	<dc:date>2026-07-10</dc:date>

	<prism:publicationName>Information</prism:publicationName>
	<prism:publicationDate>2026-07-10</prism:publicationDate>
	<prism:volume>17</prism:volume>
	<prism:number>7</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>671</prism:startingPage>
		<prism:doi>10.3390/info17070671</prism:doi>
	<prism:url>https://www.mdpi.com/2078-2489/17/7/671</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>
