Abstract

Abstract
This paper presents work-in-progress of the POSTDATA project. This project aims to provide means to solve the interoperability issues that exist among the digital poetry repertoires. These repertoires hold data of poetry metrics that is locked in their own databases and it is not freely available to be compared and to be used by intelligent machines that could infer over the data. The POSTDATA project will use Linked Open Data (LOD) technologies to overcome the interoperability problems. POSTDATA is developing a metadata application profile (MAP) for the digital poetry repertoires, a construct that enhances interoperability. This development follows the method for the development of MAP (Me4MAP). A MAP for the digital poetry repertoires will open doors for these repertoires to be able to structure the data with a common model in order to publish it as Linked Open Data. This paper presents how this MAP is being developed so far.

Abstract
This paper contributes to developing a Method for Creating Persona Templates (MCPT), addressing a significant gap in user-centred design methodologies. Utilising qualitative data collection and analysis techniques, MCPT offers a systematic approach to developing robust and context-oriented persona templates. MCPT was created by applying the Design Science Research (DSR) methodology, and it incorporates multiple iterations for template refinement and validation among project stakeholders; all of the proposed steps of this method were based on theoretical contributions. Furthermore, MCPT was tested and refined within a real-life R&D project focusing on developing a digital platform e-marketplace for short agrifood supply chains in two iteration cycles. MCPT fills a critical void in persona research by providing detailed instructions for each step of template development. By involving the target audience, users, and project stakeholders, MCPT adds rigour to the persona creation process, enhancing the quality and relevance of personae casts. This paper contributes to the body of knowledge by offering an initial proposal of a comprehensive method for creating persona templates within diverse projects and contexts. Further research should explore MCPT’s adaptability to different settings and projects, thus refining its effectiveness and extending its utility in user-centred design practices. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

Abstract
Influential spreaders are key nodes in networks that maximize or control the spreading processes. Many real-world systems are represented as weighted networks, and several indexing methods, such as weighted betweenness, closeness, k-shell decomposition, voterank, and mixed degree decomposition, among others, have been proposed to identify these influential nodes. However, these methods often face limitations such as high computational cost, non-monotonic rankings, and reliance on tunable parameters. To address these issues, this paper introduces a new tunable parameter-free method, Normalized Strength-Degree Centrality (nsd), which efficiently combines a node's normalized degree and strength to measure its influence across various network structures. Experimental results on eleven real and synthetic weighted networks show that nsd outperforms the existing methods in accurately identifying influential spreaders, strongly correlating to the Weighted Susceptible-Infected-Recovered (WSIR) model. Additionally, nsd is a parameter-free method that does not require time-consuming preprocessing to estimate rankings.

Abstract
Influential nodes are the important nodes that most efficiently control the propagation process throughout the network. Among various structural-based methods, degree centrality, k-shell decomposition, or their combination identify influential nodes with relatively low computational complexity, making them suitable for large-scale network analysis. However, these methods do not necessarily explore nodes' underlying structure and neighboring information, which poses a significant challenge for researchers in developing timely and efficient heuristics considering appropriate network characteristics. In this study, we propose a new method (IC-SNI) to measure the influential capability of the nodes. IC-SNI minimizes the loopholes of the local and global centrality and calculates the topological positional structure by considering the local and global contribution of the neighbors. Exploring the path structural information, we introduce two new measurements (connectivity strength and effective distance) to capture the structural properties among the neighboring nodes. Finally, the influential capability of a node is calculated by aggregating the structural and neighboring information of up to two-hop neighboring nodes. Evaluated on nine benchmark datasets, IC-SNI demonstrates superior performance with the highest average ranking correlation of 0.813 with the SIR simulator and a 34.1% improvement comparing state-of-the-art methods in identifying influential spreaders. The results show that IC-SNI efficiently identifies the influential spreaders in diverse real networks by accurately integrating structural and neighboring information.