首页 > 最新文献

SN computer science最新文献

英文 中文
To Signal or Not to Signal? A Non-cooperative Game-Theoretic Approach to Discretionary Communication Between Road Users. 发信号还是不发信号?道路使用者自由沟通的非合作博弈论研究。
Pub Date : 2026-01-01 Epub Date: 2025-12-17 DOI: 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}
引用次数: 0
A Combinatorial Approach to Synthetic Data Generation for Machine Learning. 机器学习合成数据生成的组合方法。
Pub Date : 2026-01-01 Epub Date: 2026-01-07 DOI: 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.

机器学习中使用的数据集通常包含敏感信息,包括个人可识别的健康和财务细节。组织和研究人员面临的一个共同挑战是,在使用真实世界的数据时,存在隐私泄露的风险。合成数据可以用来替代真实数据。在现有的合成数据生成技术中,编码器处理真实世界的数据以将其映射到较低维的潜在空间。然后在这个潜在空间中进行随机抽样。随后,利用解码器网络从潜在空间中的这些采样点生成合成数据。这种方法通常需要生成大量的合成样本来近似真实数据的性能,从而减慢下游机器学习任务的速度。为了解决这个问题,我们引入了一种组合方法来对潜在空间进行采样,这是由我们在本研究中的经验发现所激发的,即大多数模型预测在很大程度上受到几个特征之间相互作用的影响。在某些情况下,仅使用少量特征比使用整个特征产生更好的准确性。通过这种方法,我们生成了利用n中的t个潜在维度之间的t-way相互作用的样本。我们的实验结果表明,我们的方法比传统的随机抽样需要更少的样本,以实现对现实世界数据集的可比模型性能。我们还表明,当与差异私有机制集成时,我们的方法比现有的随机抽样方法在模型性能上的下降要小。
{"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}
引用次数: 0
TRAM: The Telecommunications-Related AcciMap Method. TRAM:与电信相关的AcciMap方法。
Pub Date : 2026-01-01 Epub Date: 2026-01-13 DOI: 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}
引用次数: 0
Outdoor Warehouse Management: UAS-Driven Precision Tracking of Stacked Steel Bars. 户外仓库管理:uas驱动的钢筋堆垛精确跟踪。
Pub Date : 2025-01-01 Epub Date: 2025-07-28 DOI: 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.

由于多变的照明、天气条件和缺乏固定的基础设施,在室外环境(如仓库或工业场地)中准确识别产品的位置提出了独特的挑战。本文提出了一种基于视觉的无人机系统,利用二维码检测和相对定位来实现产品定位。所提出的系统使无人机能够自主扫描一个区域,从捕获的视频帧中提取QR码,并使用可信度图计算产品之间的空间关系。与传统的基于GPS或rfid的方法不同,我们的方法不依赖于外部基础设施,使其可扩展并适应户外和半结构化环境。我们证明,即使在遮挡和光照变化的情况下,该算法在室内环境下的定位精度超过94%,在室外环境下的定位精度超过80%。本工作的主要贡献包括:(1)基于相对空间关系的新型无基础设施产品定位方法;(2)集成可信度评分以提高检测位置的可靠性;(3)在真实的室内和室外工业场景中进行了广泛的评估。这些结果验证了无人机辅助库存系统在提高物流和仓库管理自动化方面的潜力。
{"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}
引用次数: 0
Fast and Secure Multiparty Querying over Federated Graph Databases. 基于联邦图数据库的快速安全多方查询。
Pub Date : 2025-01-01 Epub Date: 2025-11-28 DOI: 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.

我们已经开发了一个框架,用于在联邦图数据库上有效地保护隐私的多方查询(PPMQ),利用安全多方计算(SMPC)协议来增强数据安全性。该系统提供两种不同的安全协议:基于客户端的协议和基于服务器的协议。在基于客户机的协议中,采用了标准的SMPC技术,允许在不暴露数据本身的情况下对数据执行计算。基于服务器的协议使用SMPC来促进安全的数据处理,并通过加密散列进一步增强,这增加了额外的安全性以防止数据暴露。我们将PPMQ与Neo4j Fabric以及之前的两个系统SMPQ和Conclave进行了比较实验。结果表明,PPMQ的执行时间和开销与Neo4j Fabric相当,同时优于SMPQ和Conclave,证明了其优越的效率。此外,PPMQ与SMPQ和Conclave一样,使用诚实但奇特的安全模型。但是,它增强了服务器协议的安全性,使其对暴力攻击更加健壮,并提供比以前的解决方案更强的隐私保证。
{"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}
引用次数: 0
Variable Trust Control Setting for Autonomous Vehicle Highway Navigation and Improved User Experience. 自动驾驶汽车公路导航的可变信任控制设置与用户体验改善。
Pub Date : 2025-01-01 Epub Date: 2025-03-13 DOI: 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.

本文探讨了如何开发一种基于模型的设计方法,以提高人们对自动驾驶汽车(AV)在高速公路上安全机动性的接受度。本文引入了一种可变的信任控制设置(TCS),使用户能够 "感受到 "对自动驾驶汽车的 "控制",从而增强对该技术的信心和接受度。这种设置以义务伦理为基础,利用虚拟边界(VBs)来指导驾驶决策,即两个相互影响的自动驾驶汽车之间的距离。该方法使用代表每辆自动驾驶汽车的动态自行车模型进行模拟,并通过自适应模型预测控制(MPC)算法进行控制。本文概述了 MPC 方法、动态自行车模型以及相关的速度控制算法。文中介绍了在与其他自动驾驶汽车交互过程中量化特定自动驾驶汽车操纵安全性的指标,以便对各种情况进行检查。还开发了一个新颖的模拟软件包,用于研究拟议的可变 TCS 的影响,重点关注 VB 和转向限制如何影响超车机动过程中自动驾驶汽车的安全性和舒适性。研究结果证明了这种方法的有效性,表明它有可能让用户主动管理自动驾驶汽车运行的安全性和舒适性。
{"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}
引用次数: 0
The Effects of Visual Behavior and Ego-Movement on Foveated Rendering Performance in Virtual Reality. 虚拟现实中视觉行为和自我运动对注视点渲染性能的影响。
Pub Date : 2025-01-01 Epub Date: 2025-04-15 DOI: 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.

尽管VR最近有了发展,但由于带宽能力和所需计算资源的增加,保持真实感是困难的。为了让VR变得更实惠,Foveated Rendering (FR)等技术提供了在不影响用户体验的情况下优化渲染的有希望的方法。具有6DOF跟踪的近眼显示器使用户能够在环境中自由移动。这在以前的传统显示器上是不可能实现的。本研究旨在厘清自我运动类型(主动与隐含)和任务类型(简单注视与涉及注视、辨别和计数的任务)对使用可变速率着色(VRS)开发的动态FR方法的影响(四分之一的原生着色率用于视觉外围)。我们还探讨了上述效果在不同的视觉行为下是否一致(视觉搜索与跟踪)。结果表明,参与者积极移动和执行复杂任务(在视觉搜索期间)对退化的敏感性低于其他条件,只有31.7%的视场需要使用全采样进行渲染。此外,我们为视觉追求如何影响这些结果提供了证据;在这种情况下,只有29.3%的视场呈现使用全采样被参与者容忍。
{"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}
引用次数: 0
Advancing Point Cloud Perception: A Focus on People Detection. 推进点云感知:关注人的检测。
Pub Date : 2025-01-01 Epub Date: 2025-07-28 DOI: 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.

点云数据已成为三维场景分析的关键,但由于数据稀疏、不规则采样和遮挡,对人类进行鲁棒实时检测仍然具有挑战性。在本研究中,我们提出了一个特征工程管道,该管道使用随机森林分类器(RFC)在高分辨率激光雷达点云中进行有效的人员检测。我们的贡献包括:(1)使用区域增长的地面去除算法的详细参数化;一个由15个几何和强度描述符组成的紧凑特征集;(3)两个数据集的综合评价指标;(4)与MLP和PointNet基线的对比分析。实验证明我们的RFC取得了良好的效果。这些结果验证了我们的方法在点云环境中实时、设备上的人类检测的实际适用性。
{"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}
引用次数: 0
Fault Tree Reliability Analysis via Squarefree Polynomials: Mathematical and Experimental Analysis. 基于无平方多项式的故障树可靠性分析:数学与实验分析。
Pub Date : 2025-01-01 Epub Date: 2025-11-14 DOI: 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}
引用次数: 0
A Benchmark for Physics-informed Machine Learning of Chlorine Concentration States in Water Distribution Networks. 供水网络中氯浓度状态的物理信息机器学习的基准。
Pub Date : 2025-01-01 Epub Date: 2025-06-04 DOI: 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).

确保高质量的饮用水是水务公司的一项重要责任,氯是通常使用的主要消毒剂。准确估计配水管网动态环境中的氯浓度对保证供水安全至关重要。这项工作介绍了一个全面和精心创建的基准,用于培训和评估wdn中的氯浓度估计方法。该基准包括广泛研究的“Hanoi”、“Net1”和更近期、更复杂的“CY-DBP”水网络的18000个场景的多样化数据集,具有各种氯注入模式,以捕捉不同的物理动态。为了提供基线评估,我们提出并评估了氯状态估计的两种神经代理模型:物理信息图神经网络(GNN)和物理引导递归神经网络(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}
引用次数: 0
期刊
SN computer science
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1