Pub Date : 2026-01-01Epub Date: 2025-12-17DOI: 10.1007/s42979-025-04533-w
Isam Bitar, Albert Solernou Crusat, Richard Romano, David Watling
Reciprocal communication between road users is a vital element of road user interaction. Non-cooperative game theory is an effective framework for modelling and characterising communicative behaviour between road users, which enables the study of emergent benefits for both the issuer and recipient of communicative signals. In this paper, we introduce discretionary communication to gain an advantage over the other road user by masking one's intent if beneficial to do so. We conduct a series of experiments with simulated interactions and compare interaction outcomes where communication is mandatory against those where communication is discretionary. Our findings further support the premise that non-cooperative game theory is an effective paradigm for modelling and producing emergent behaviours which benefit the network. Moreover, we see that including a layer of discretionary communication reaps benefits in interaction outcome to the communicator. It also provides benefits in safety to all parties involved above and beyond the benefits seen from mandatory communication.
{"title":"To Signal or Not to Signal? A Non-cooperative Game-Theoretic Approach to Discretionary Communication Between Road Users.","authors":"Isam Bitar, Albert Solernou Crusat, Richard Romano, David Watling","doi":"10.1007/s42979-025-04533-w","DOIUrl":"10.1007/s42979-025-04533-w","url":null,"abstract":"<p><p>Reciprocal communication between road users is a vital element of road user interaction. Non-cooperative game theory is an effective framework for modelling and characterising communicative behaviour between road users, which enables the study of emergent benefits for both the issuer and recipient of communicative signals. In this paper, we introduce discretionary communication to gain an advantage over the other road user by masking one's intent if beneficial to do so. We conduct a series of experiments with simulated interactions and compare interaction outcomes where communication is mandatory against those where communication is discretionary. Our findings further support the premise that non-cooperative game theory is an effective paradigm for modelling and producing emergent behaviours which benefit the network. Moreover, we see that including a layer of <i>discretionary</i> communication reaps benefits in interaction outcome to the communicator. It also provides benefits in safety to all parties involved above and beyond the benefits seen from mandatory communication.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"7 1","pages":"3"},"PeriodicalIF":0.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12711921/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145807133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-01Epub Date: 2026-01-07DOI: 10.1007/s42979-025-04540-x
Krishna Khadka, Jaganmohan Chandrasekaran, Yu Lei, Raghu Kacker, D Richard Kuhn
Datasets used in machine learning often contain sensitive information, including personally identifiable health and financial details. A common challenge faced by organizations and researchers is the risk of privacy breaches when using real-world data. Synthetic data can be used as an alternative to the real-world data. In existing synthetic data generation techniques, an encoder processes the real-world data to map it into a lower-dimensional latent space. Random sampling is then performed in this latent space. Subsequently, a decoder network is utilized to generate synthetic data from these sampled points in the latent space. Such approaches typically require generating a large number of synthetic samples to approximate the performance of real-world data, subsequently slowing down downstream machine learning tasks. Addressing this, we introduce a combinatorial approach to sampling the latent space, motivated by our empirical findings within this study that most model predictions are largely influenced by interactions between a few features. In some cases, just using a small number of features produces accuracy better than using entire features. Through this approach, we generate samples that utilize t-way interactions among the t latent dimensions out of n. Our experimental results indicate that our approach requires fewer samples than traditional random sampling to achieve comparable model performance for real-world data sets. We also show that when integrated with a differentially private mechanism, our approach incurs a smaller decline in model performance than existing random sampling approach.
{"title":"A Combinatorial Approach to Synthetic Data Generation for Machine Learning.","authors":"Krishna Khadka, Jaganmohan Chandrasekaran, Yu Lei, Raghu Kacker, D Richard Kuhn","doi":"10.1007/s42979-025-04540-x","DOIUrl":"10.1007/s42979-025-04540-x","url":null,"abstract":"<p><p>Datasets used in machine learning often contain sensitive information, including personally identifiable health and financial details. A common challenge faced by organizations and researchers is the risk of privacy breaches when using real-world data. Synthetic data can be used as an alternative to the real-world data. In existing synthetic data generation techniques, an encoder processes the real-world data to map it into a lower-dimensional latent space. Random sampling is then performed in this latent space. Subsequently, a decoder network is utilized to generate synthetic data from these sampled points in the latent space. Such approaches typically require generating a large number of synthetic samples to approximate the performance of real-world data, subsequently slowing down downstream machine learning tasks. Addressing this, we introduce a combinatorial approach to sampling the latent space, motivated by our empirical findings within this study that most model predictions are largely influenced by interactions between a few features. In some cases, just using a small number of features produces accuracy better than using entire features. Through this approach, we generate samples that utilize t-way interactions among the t latent dimensions out of n. Our experimental results indicate that our approach requires fewer samples than traditional random sampling to achieve comparable model performance for real-world data sets. We also show that when integrated with a differentially private mechanism, our approach incurs a smaller decline in model performance than existing random sampling approach.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"7 1","pages":"59"},"PeriodicalIF":0.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12779700/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145954553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2026-01-01Epub Date: 2026-01-13DOI: 10.1007/s42979-025-04502-3
Hans C A Wienen, Faiza A Bukhsh, Eelco Vriezekolk, Luís Ferreira Pires
Telecommunications networks are essential to the functioning of modern society, and large-scale disruptions in these networks can significantly impact societal operations. This paper presents Tram (Telecommunications Related AcciMap), an accident analysis method developed to support the analysis of accidents in telecommunication networks. Tram aimed to allow lessons learned from an accident to be used to mitigate and/or prevent new accidents, ultimately enhancing societal resilience. Initially, we studied the state-of-the-art in accident analysis methods, concluding that we should start from the AcciMap method since this is the most popular and appropriate method for our purposes. Tram has been developed through iterative cycles in which improvements have been proposed and validated; this paper focuses on the last iteration. Tram is a validated method that supports comprehensive analyses of telecom accidents. The latest version added support to the representation and mitigation of positive feedback loops during telecom and information technology systems breakdowns, and can help prioritise the recommendations derived from an analysis. This paper demonstrates that Tram is a suitable method to analyse and learn lessons from accidents in the telecom domain. Particularly, our findings with the application of Tram to real-life accidents indicate that dividing the analysis process by participant expertise can negatively impact the efficiency of the overall process, so the partitioning of the analysis process should be carefully considered.
电信网络对现代社会的运作至关重要,这些网络的大规模中断会对社会运作产生重大影响。本文介绍了一种为支持电信网络事故分析而开发的事故分析方法Tram (Telecommunications Related AcciMap)。Tram旨在将从事故中吸取的经验教训用于减轻和/或预防新的事故,最终增强社会的复原力。最初,我们研究了最先进的事故分析方法,得出结论,我们应该从AcciMap方法开始,因为这是最流行和最适合我们目的的方法。有轨电车的发展经历了反复的循环,在此循环中提出了改进建议并进行了验证;本文的重点是最后一次迭代。Tram是一种经过验证的电信事故综合分析方法。最新版本增加了对电信和信息技术系统故障期间正反馈循环的表示和缓解的支持,并有助于确定从分析中得出的建议的优先次序。本文论证了Tram是一种适合电信领域事故分析和经验教训的方法。特别是,我们将Tram应用于现实事故的研究结果表明,按参与者的专业知识划分分析过程会对整个过程的效率产生负面影响,因此应仔细考虑分析过程的划分。
{"title":"TRAM: The Telecommunications-Related AcciMap Method.","authors":"Hans C A Wienen, Faiza A Bukhsh, Eelco Vriezekolk, Luís Ferreira Pires","doi":"10.1007/s42979-025-04502-3","DOIUrl":"10.1007/s42979-025-04502-3","url":null,"abstract":"<p><p>Telecommunications networks are essential to the functioning of modern society, and large-scale disruptions in these networks can significantly impact societal operations. This paper presents Tram (Telecommunications Related AcciMap), an accident analysis method developed to support the analysis of accidents in telecommunication networks. Tram aimed to allow lessons learned from an accident to be used to mitigate and/or prevent new accidents, ultimately enhancing societal resilience. Initially, we studied the state-of-the-art in accident analysis methods, concluding that we should start from the AcciMap method since this is the most popular and appropriate method for our purposes. Tram has been developed through iterative cycles in which improvements have been proposed and validated; this paper focuses on the last iteration. Tram is a validated method that supports comprehensive analyses of telecom accidents. The latest version added support to the representation and mitigation of positive feedback loops during telecom and information technology systems breakdowns, and can help prioritise the recommendations derived from an analysis. This paper demonstrates that Tram is a suitable method to analyse and learn lessons from accidents in the telecom domain. Particularly, our findings with the application of Tram to real-life accidents indicate that dividing the analysis process by participant expertise can negatively impact the efficiency of the overall process, so the partitioning of the analysis process should be carefully considered.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"7 1","pages":"103"},"PeriodicalIF":0.0,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12799682/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145992347","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-07-28DOI: 10.1007/s42979-025-04206-8
Assia Belbachir, Antonio M Ortiz, Erik T Hauge, Ahmed Nabil Belbachir, Giusy Bonanno, Emanuele Ciccia, Giorgio Felline
Accurately identifying the positions of products in outdoor environments-such as warehouses or industrial yards-presents unique challenges due to variable lighting, weather conditions, and the lack of fixed infrastructure. This work presents a vision-based drone system for product localization using QR code detection and relative positioning. The proposed system enables a UAV to autonomously scan an area, extract QR codes from captured video frames, and compute the spatial relationships between products using a trust-ability graph. Unlike traditional GPS- or RFID-based methods, our approach does not rely on external infrastructure, making it scalable and adaptable for outdoor and semi-structured environments. We demonstrate that the proposed algorithm achieves over 94% positioning accuracy in indoor settings and 80% in outdoor environments, even under occlusion and varying illumination. The key contributions of this work include: (1) a novel infrastructure-free method for product positioning based on relative spatial relationships, (2) the integration of trust-ability scoring to improve the reliability of detected positions, and (3) an extensive evaluation in real-world indoor and outdoor industrial scenarios. These results validate the potential of UAV-assisted inventory systems to enhance automation in logistics and warehouse management.
{"title":"Outdoor Warehouse Management: UAS-Driven Precision Tracking of Stacked Steel Bars.","authors":"Assia Belbachir, Antonio M Ortiz, Erik T Hauge, Ahmed Nabil Belbachir, Giusy Bonanno, Emanuele Ciccia, Giorgio Felline","doi":"10.1007/s42979-025-04206-8","DOIUrl":"10.1007/s42979-025-04206-8","url":null,"abstract":"<p><p>Accurately identifying the positions of products in outdoor environments-such as warehouses or industrial yards-presents unique challenges due to variable lighting, weather conditions, and the lack of fixed infrastructure. This work presents a vision-based drone system for product localization using QR code detection and relative positioning. The proposed system enables a UAV to autonomously scan an area, extract QR codes from captured video frames, and compute the spatial relationships between products using a trust-ability graph. Unlike traditional GPS- or RFID-based methods, our approach does not rely on external infrastructure, making it scalable and adaptable for outdoor and semi-structured environments. We demonstrate that the proposed algorithm achieves over 94% positioning accuracy in indoor settings and 80% in outdoor environments, even under occlusion and varying illumination. The key contributions of this work include: (1) a novel infrastructure-free method for product positioning based on relative spatial relationships, (2) the integration of trust-ability scoring to improve the reliability of detected positions, and (3) an extensive evaluation in real-world indoor and outdoor industrial scenarios. These results validate the potential of UAV-assisted inventory systems to enhance automation in logistics and warehouse management.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 6","pages":"701"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12304023/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144755535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-11-28DOI: 10.1007/s42979-025-04503-2
Nouf Aljuaid, Alexei Lisitsa, Sven Schewe
We have developed a framework for efficient privacy preserving multi-party querying (PPMQ) over federated graph databases, leveraging Secure Multi-Party Computation (SMPC) protocols to enhance data security. The system offers two distinct security protocols: a client-based protocol and a server-based protocol. In the client-based protocol, standard SMPC techniques are employed, allowing computations to be performed on data without exposing the data itself. The server-based protocol employs SMPC to facilitate secure data processing and is further enhanced by encrypted hashing, which adds an additional layer of security to prevent data exposure. We conducted experiments comparing PPMQ with Neo4j Fabric and two previous systems, SMPQ and Conclave. The results indicate that PPMQ's execution times and overheads are comparable to those of Neo4j Fabric, while outperforming both SMPQ and Conclave, demonstrating its superior efficiency. Additionally, PPMQ, like SMPQ and Conclave, utilises an honest but curious security model. However, it enhances the security of the server protocol, making it more robust against brute force attacks and providing stronger privacy guarantees than previous solutions.
{"title":"Fast and Secure Multiparty Querying over Federated Graph Databases.","authors":"Nouf Aljuaid, Alexei Lisitsa, Sven Schewe","doi":"10.1007/s42979-025-04503-2","DOIUrl":"10.1007/s42979-025-04503-2","url":null,"abstract":"<p><p>We have developed a framework for efficient privacy preserving multi-party querying (PPMQ) over federated graph databases, leveraging Secure Multi-Party Computation (SMPC) protocols to enhance data security. The system offers two distinct security protocols: a client-based protocol and a server-based protocol. In the client-based protocol, standard SMPC techniques are employed, allowing computations to be performed on data without exposing the data itself. The server-based protocol employs SMPC to facilitate secure data processing and is further enhanced by encrypted hashing, which adds an additional layer of security to prevent data exposure. We conducted experiments comparing PPMQ with Neo4j Fabric and two previous systems, SMPQ and Conclave. The results indicate that PPMQ's execution times and overheads are comparable to those of Neo4j Fabric, while outperforming both SMPQ and Conclave, demonstrating its superior efficiency. Additionally, PPMQ, like SMPQ and Conclave, utilises an honest but curious security model. However, it enhances the security of the server protocol, making it more robust against brute force attacks and providing stronger privacy guarantees than previous solutions.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 8","pages":"982"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12662885/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145650667","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-03-13DOI: 10.1007/s42979-025-03714-x
James E Pickering, Jisun Kim, Joshua D'Souza, Keith J Burnham
This paper addresses the development of a model-based design approach to enhance the acceptance of safe manoeuvrability of autonomous vehicles (AVs) on highways. A variable trust control setting (TCS) is introduced that empowers users to 'feel in control' of the AV, potentially increasing confidence in, and acceptance of, the technology. This setting is grounded in deontological ethics and utilises virtual boundaries (VBs) to guide driving decisions, i.e., the distance between two AVs interacting with one another. The approach is simulated using a dynamic bicycle model that represents each AV, controlled through an adaptive model-predictive control (MPC) algorithm. The paper outlines the MPC approach, the dynamic bicycle model, and the associated velocity control algorithm. Metrics are introduced to quantify safety of specific AV manoeuvres during interactions with other AVs, enabling the examination of various scenarios. A novel simulation package has been developed to investigate the impact of the proposed variable TCS, focusing on how VBs and steering limitations influence the safety and comfort of AVs during overtaking manoeuvres. The findings demonstrate the effectiveness of this approach, showing that it could potentially allow users to actively manage the safety and comfort aspects of AV operation.
{"title":"Variable Trust Control Setting for Autonomous Vehicle Highway Navigation and Improved User Experience.","authors":"James E Pickering, Jisun Kim, Joshua D'Souza, Keith J Burnham","doi":"10.1007/s42979-025-03714-x","DOIUrl":"https://doi.org/10.1007/s42979-025-03714-x","url":null,"abstract":"<p><p>This paper addresses the development of a model-based design approach to enhance the acceptance of safe manoeuvrability of autonomous vehicles (AVs) on highways. A variable trust control setting (TCS) is introduced that empowers users to 'feel in control' of the AV, potentially increasing confidence in, and acceptance of, the technology. This setting is grounded in deontological ethics and utilises virtual boundaries (VBs) to guide driving decisions, i.e., the distance between two AVs interacting with one another. The approach is simulated using a dynamic bicycle model that represents each AV, controlled through an adaptive model-predictive control (MPC) algorithm. The paper outlines the MPC approach, the dynamic bicycle model, and the associated velocity control algorithm. Metrics are introduced to quantify safety of specific AV manoeuvres during interactions with other AVs, enabling the examination of various scenarios. A novel simulation package has been developed to investigate the impact of the proposed variable TCS, focusing on how VBs and steering limitations influence the safety and comfort of AVs during overtaking manoeuvres. The findings demonstrate the effectiveness of this approach, showing that it could potentially allow users to actively manage the safety and comfort aspects of AV operation.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 3","pages":"278"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11906505/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143652926","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-04-15DOI: 10.1007/s42979-025-03885-7
David Petrescu, Paul A Warren, Zahra Montazeri, Gabriel Strain, Steve Pettifer
Despite the recent developments in VR, maintaining photorealism is difficult due to the increased bandwidth capabilities and computational resources required. To make VR more affordable, techniques such as Foveated Rendering (FR) offer promising ways to optimise rendering without compromising the user experience. Near-eye displays with 6DOF tracking enable users to freely move through the environment. This was previously impossible with traditional displays. This work aims to disentangle the effect of type of ego-movement (Active versus Implied) and task type (Simple Fixations versus a task involving Fixations, Discrimination, and Counting) on a dynamic FR method developed using Variable Rate Shading (VRS) (a quarter of the native shading rate is used in the visual periphery). We also explore if the aforementioned effects are consistent under different visual behaviours (visual search versus tracking). Results show that participants actively moving and performing complex tasks (during visual search) are less sensitive to degradation than in other conditions, with only 31.7% of the FOV required to be rendered using full sampling. Additionally, we provide evidence for how instances of visual pursuit might influence these results; in this case, only 29.3% of the FOV rendered using full sampling is tolerated by participants.
{"title":"The Effects of Visual Behavior and Ego-Movement on Foveated Rendering Performance in Virtual Reality.","authors":"David Petrescu, Paul A Warren, Zahra Montazeri, Gabriel Strain, Steve Pettifer","doi":"10.1007/s42979-025-03885-7","DOIUrl":"https://doi.org/10.1007/s42979-025-03885-7","url":null,"abstract":"<p><p>Despite the recent developments in VR, maintaining photorealism is difficult due to the increased bandwidth capabilities and computational resources required. To make VR more affordable, techniques such as Foveated Rendering (FR) offer promising ways to optimise rendering without compromising the user experience. Near-eye displays with 6DOF tracking enable users to freely move through the environment. This was previously impossible with traditional displays. This work aims to disentangle the effect of type of ego-movement (Active versus Implied) and task type (Simple Fixations versus a task involving Fixations, Discrimination, and Counting) on a dynamic FR method developed using Variable Rate Shading (VRS) (a quarter of the native shading rate is used in the visual periphery). We also explore if the aforementioned effects are consistent under different visual behaviours (visual search versus tracking). Results show that participants actively moving and performing complex tasks (during visual search) are less sensitive to degradation than in other conditions, with only 31.7% of the FOV required to be rendered using full sampling. Additionally, we provide evidence for how instances of visual pursuit might influence these results; in this case, only 29.3% of the FOV rendered using full sampling is tolerated by participants.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 4","pages":"386"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12000250/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144061252","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-07-28DOI: 10.1007/s42979-025-04221-9
Assia Belbachir, Antonio M Ortiz, Atle Aalerud, Ahmed Nabil Belbachir
Point-cloud data have become pivotal for three-dimensional scene analysis, yet robust real-time detection of humans remains challenging due to data sparsity, irregular sampling, and occlusions. In this study, we present a feature-engineered pipeline that uses a Random Forest Classifier (RFC) for efficient people detection in high-resolution LiDAR point clouds. Our contributions include: (1) detailed parameterization of a ground-removal algorithm using region growing; a compact feature set of 15 geometric and intensity-based descriptors; (3) comprehensive evaluation metrics on two datasets; and (4) comparative analysis against MLP and PointNet baselines. Experiments demonstrate that our RFC achieves good results. These results validate the practical applicability of our approach for real-time, on-device human detection in point-cloud environments.
{"title":"Advancing Point Cloud Perception: A Focus on People Detection.","authors":"Assia Belbachir, Antonio M Ortiz, Atle Aalerud, Ahmed Nabil Belbachir","doi":"10.1007/s42979-025-04221-9","DOIUrl":"10.1007/s42979-025-04221-9","url":null,"abstract":"<p><p>Point-cloud data have become pivotal for three-dimensional scene analysis, yet robust real-time detection of humans remains challenging due to data sparsity, irregular sampling, and occlusions. In this study, we present a feature-engineered pipeline that uses a Random Forest Classifier (RFC) for efficient people detection in high-resolution LiDAR point clouds. Our contributions include: (1) detailed parameterization of a ground-removal algorithm using region growing; a compact feature set of 15 geometric and intensity-based descriptors; (3) comprehensive evaluation metrics on two datasets; and (4) comparative analysis against MLP and PointNet baselines. Experiments demonstrate that our RFC achieves good results. These results validate the practical applicability of our approach for real-time, on-device human detection in point-cloud environments.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 6","pages":"698"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12304050/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144755534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-11-14DOI: 10.1007/s42979-025-04450-y
Milan Lopuhaä-Zwakenberg
Quantitative analysis of risk models is essential to ensure the resilience of complex systems. Fault trees (FTs) form a ubiquitous prominent risk model, and unreliability is its key safety metric. As complex systems have larger and larger models, the complexity of algorithms computing unreliability is a pressing concern. Unfortunately, state-of-the-art algorithms, based on binary decision diagrams, do not give time complexity guarantees beyond a worst-case exponential bound. To address this issue, this paper introduces a new method to compute FT unreliability, extending the fast bottom-up algorithm for tree-shaped FTs to general FTs by framing its arithmetic in algebras of squarefree polynomials. We prove the validity of this algorithm, and that its time complexity is linear when the number of multiparent nodes is limited. Experiments establish the competitiveness of our new method.
{"title":"Fault Tree Reliability Analysis via Squarefree Polynomials: Mathematical and Experimental Analysis.","authors":"Milan Lopuhaä-Zwakenberg","doi":"10.1007/s42979-025-04450-y","DOIUrl":"https://doi.org/10.1007/s42979-025-04450-y","url":null,"abstract":"<p><p>Quantitative analysis of risk models is essential to ensure the resilience of complex systems. Fault trees (FTs) form a ubiquitous prominent risk model, and unreliability is its key safety metric. As complex systems have larger and larger models, the complexity of algorithms computing unreliability is a pressing concern. Unfortunately, state-of-the-art algorithms, based on binary decision diagrams, do not give time complexity guarantees beyond a worst-case exponential bound. To address this issue, this paper introduces a new method to compute FT unreliability, extending the fast bottom-up algorithm for tree-shaped FTs to general FTs by framing its arithmetic in algebras of squarefree polynomials. We prove the validity of this algorithm, and that its time complexity is linear when the number of multiparent nodes is limited. Experiments establish the competitiveness of our new method.</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 8","pages":"965"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12618395/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145544771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2025-01-01Epub Date: 2025-06-04DOI: 10.1007/s42979-025-04008-y
Luca Hermes, André Artelt, Stelios G Vrachimis, Marios M Polycarpou, Barbara Hammer
Ensuring high-quality drinking water is a critical responsibility of water utilities, with chlorine being the main disinfectant typically used. Accurate estimation of chlorine concentrations in the dynamic environment of water distribution networks (WDNs) is essential to ensure safe water supply. This work introduces a comprehensive and carefully created benchmark for training and evaluation of chlorine concentration estimation methodologies in WDNs. The benchmark includes a diverse dataset of 18,000 scenarios of the widely studied 'Hanoi', 'Net1', and the more recent and complex 'CY-DBP' water networks, featuring various chlorine injection patterns to capture diverse physical dynamics. To provide baseline evaluations, we propose and evaluate two neural surrogate models for chlorine state estimation: a physics-informed Graph Neural Network (GNN) and a physics-guided Recurrent Neural Network (RNN).
{"title":"A Benchmark for Physics-informed Machine Learning of Chlorine Concentration States in Water Distribution Networks.","authors":"Luca Hermes, André Artelt, Stelios G Vrachimis, Marios M Polycarpou, Barbara Hammer","doi":"10.1007/s42979-025-04008-y","DOIUrl":"10.1007/s42979-025-04008-y","url":null,"abstract":"<p><p>Ensuring high-quality drinking water is a critical responsibility of water utilities, with chlorine being the main disinfectant typically used. Accurate estimation of chlorine concentrations in the dynamic environment of water distribution networks (WDNs) is essential to ensure safe water supply. This work introduces a comprehensive and carefully created benchmark for training and evaluation of chlorine concentration estimation methodologies in WDNs. The benchmark includes a diverse dataset of 18,000 scenarios of the widely studied 'Hanoi', 'Net1', and the more recent and complex 'CY-DBP' water networks, featuring various chlorine injection patterns to capture diverse physical dynamics. To provide baseline evaluations, we propose and evaluate two neural surrogate models for chlorine state estimation: a physics-informed Graph Neural Network (GNN) and a physics-guided Recurrent Neural Network (RNN).</p>","PeriodicalId":94207,"journal":{"name":"SN computer science","volume":"6 5","pages":"522"},"PeriodicalIF":0.0,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12137424/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144251599","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}