High-Confidence Computing最新文献

An insider threat detection method based on improved Test-Time Training model

IF 3.2

High-Confidence Computing Pub Date : 2025-01-14 DOI: 10.1016/j.hcc.2024.100283

Xiaoling Tao , Jianxiang Liu , Yuelin Yu , Haijing Zhang , Ying Huang

{"title":"An insider threat detection method based on improved Test-Time Training model","authors":"Xiaoling Tao , Jianxiang Liu , Yuelin Yu , Haijing Zhang , Ying Huang","doi":"10.1016/j.hcc.2024.100283","DOIUrl":"10.1016/j.hcc.2024.100283","url":null,"abstract":"<div><div>As network and information systems become widely adopted across industries, cybersecurity concerns have grown more prominent. Among these concerns, insider threats are considered particularly covert and destructive. Insider threats refer to malicious insiders exploiting privileged access to networks, systems, and data to intentionally compromise organizational security. Detecting these threats is challenging due to the complexity and variability of user behavior data, combined with the subtle and covert nature of insider actions. Traditional detection methods often fail to capture both long-term dependencies and short-term fluctuations in time-series data, which are crucial for identifying anomalous behaviors. To address these issues, this paper introduces the Test-Time Training (TTT) model for the first time in the field of insider threat detection, and proposes a detection method based on the TTT-ECA-ResNet model. First, the dataset is preprocessed. TTT is applied to extract long-term dependencies in features, effectively capturing dynamic sequence changes. The Residual Network, incorporating the Efficient Channel Attention mechanism, is used to extract local feature patterns, capturing relationships between different positions in time-series data. Finally, a Linear layer is employed for more precise detection of insider threats. The proposed approaches were evaluated using the CMU CERT Insider Threat Dataset, achieving an AUC of 98.75% and an F1-score of 96.81%. The experimental results demonstrate the effectiveness of the proposed methods, outperforming other state-of-the-art approaches.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 1","pages":"Article 100283"},"PeriodicalIF":3.2,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422030","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

Kubernetes application performance benchmarking on heterogeneous CPU architecture: An experimental review

IF 3.2

High-Confidence Computing Pub Date : 2024-12-18 DOI: 10.1016/j.hcc.2024.100276

Jannatun Noor, MD Badsha Faysal, MD Sheikh Amin, Bushra Tabassum, Tamim Raiyan Khan, Tanvir Rahman

{"title":"Kubernetes application performance benchmarking on heterogeneous CPU architecture: An experimental review","authors":"Jannatun Noor, MD Badsha Faysal, MD Sheikh Amin, Bushra Tabassum, Tamim Raiyan Khan, Tanvir Rahman","doi":"10.1016/j.hcc.2024.100276","DOIUrl":"10.1016/j.hcc.2024.100276","url":null,"abstract":"<div><div>With the rapid advancement of cloud technologies, cloud services have enormously contributed to the cloud community for application development life-cycle. In this context, Kubernetes has played a pivotal role as a cloud computing tool, enabling developers to adopt efficient and automated deployment strategies. Using Kubernetes as an orchestration tool and a cloud computing system as a manager of the infrastructures, developers can boost the development and deployment process. With cloud providers such as GCP, AWS, Azure, and Oracle offering Kubernetes services, the availability of both x86 and ARM platforms has become evident. However, while x86 currently dominates the market, ARM-based solutions have seen limited adoption, with only a few individuals actively working on ARM deployments. This study explores the efficiency and cost-effectiveness of implementing Kubernetes on different CPU platforms. By comparing the performance of x86 and ARM platforms, this research seeks to ascertain whether transitioning to ARM presents a more advantageous option for Kubernetes deployments. Through a comprehensive evaluation of scalability, cost, and overall performance, this study aims to shed light on the viability of leveraging ARM on different CPUs by providing valuable insights.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 1","pages":"Article 100276"},"PeriodicalIF":3.2,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143403423","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

Erratum to “Exploring Personalized Internet of Things (PIoT), social connectivity, and Artificial Social Intelligence (ASI): A survey” [High-Confidence Computing 4 (2024) 100242]

IF 3.2

High-Confidence Computing Pub Date : 2024-12-01 DOI: 10.1016/j.hcc.2024.100294

Bisma Gulzar , Shabir Ahmad Sofi , Sahil Sholla

引用次数: 0

Three-dimensional dynamic gesture recognition method based on convolutional neural network

IF 3.2

High-Confidence Computing Pub Date : 2024-11-06 DOI: 10.1016/j.hcc.2024.100280

Ji Xi , Weiqi Zhang , Zhe Xu , Saide Zhu , Linlin Tang , Li Zhao

{"title":"Three-dimensional dynamic gesture recognition method based on convolutional neural network","authors":"Ji Xi , Weiqi Zhang , Zhe Xu , Saide Zhu , Linlin Tang , Li Zhao","doi":"10.1016/j.hcc.2024.100280","DOIUrl":"10.1016/j.hcc.2024.100280","url":null,"abstract":"<div><div>With the rapid advancement of virtual reality, dynamic gesture recognition technology has become an indispensable and critical technique for users to achieve human–computer interaction in virtual environments. The recognition of dynamic gestures is a challenging task due to the high degree of freedom and the influence of individual differences and the change of gesture space. To solve the problem of low recognition accuracy of existing networks, an improved dynamic gesture recognition algorithm based on ResNeXt architecture is proposed. The algorithm employs three-dimensional convolution techniques to effectively capture the spatiotemporal features intrinsic to dynamic gestures. Additionally, to enhance the model’s focus and improve its accuracy in identifying dynamic gestures, a lightweight convolutional attention mechanism is introduced. This mechanism not only augments the model’s precision but also facilitates faster convergence during the training phase. In order to further optimize the performance of the model, a deep attention submodule is added to the convolutional attention mechanism module to strengthen the network’s capability in temporal feature extraction. Empirical evaluations on EgoGesture and NvGesture datasets show that the accuracy of the proposed model in dynamic gesture recognition reaches 95.03% and 86.21%, respectively. When operating in RGB mode, the accuracy reached 93.49% and 80.22%, respectively. These results underscore the effectiveness of the proposed algorithm in recognizing dynamic gestures with high accuracy, showcasing its potential for applications in advanced human–computer interaction systems.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 1","pages":"Article 100280"},"PeriodicalIF":3.2,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143387521","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

Minimizing charging task time of WRSN assisted with multiple MUVs and laser-charged UAVs

IF 3.2

High-Confidence Computing Pub Date : 2024-10-05 DOI: 10.1016/j.hcc.2024.100272

Jian Zhang , Chuanwen Luo , Ning Liu , Yi Hong , Zhibo Chen

{"title":"Minimizing charging task time of WRSN assisted with multiple MUVs and laser-charged UAVs","authors":"Jian Zhang , Chuanwen Luo , Ning Liu , Yi Hong , Zhibo Chen","doi":"10.1016/j.hcc.2024.100272","DOIUrl":"10.1016/j.hcc.2024.100272","url":null,"abstract":"<div><div>This paper investigates the framework of wireless rechargeable sensor network (WRSN) assisted by multiple mobile unmanned vehicles (MUVs) and laser-charged unmanned aerial vehicles (UAVs). On the basis of framework, we cooperatively investigate the trajectory optimization of multi-UAVs and multi-MUVs for charging WRSN (TOUM) problem, whose goal aims at designing the optimal travel plan of UAVs and MUVs cooperatively to charge WRSN such that the remaining energy of each sensor in WRSN is greater than or equal to the threshold and the time consumption of UAV that takes the most time of all UAVs is minimized. The TOUM problem is proved NP-hard. To solve the TOUM problem, we first investigate the multiple UAVs-based TSP (MUTSP) problem to balance the charging tasks assigned to every UAV. Then, based on the MUTSP problem, we propose the TOUM algorithm (TOUMA) to design the detailed travel plan of UAVs and MUVs. We also present an algorithm named TOUM-DQN to make intelligent decisions about the travel plan of UAVs and MUVs by extracting valuable information from the network. The effectiveness of proposed algorithms is verified through extensive simulation experiments. The results demonstrate that the TOUMA algorithm outperforms the solar charging method, the base station charging method, and the TOUM-DQN algorithm in terms of time efficiency. Simultaneously, the experimental results show that the execution time of TOUM-DQN algorithm is significantly lower than TOUMA algorithm.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100272"},"PeriodicalIF":3.2,"publicationDate":"2024-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143817179","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Identity-based threshold (multi) signature with private accountability for privacy-preserving blockchain 基于身份的阈值（多重）签名与隐私保护区块链的私人问责制

IF 3.2

High-Confidence Computing Pub Date : 2024-09-12 DOI: 10.1016/j.hcc.2024.100271

Jing Tian , Yanqi Zhao , Xiaoyi Yang , Xuan Zhao , Ruonan Chen , Yong Yu

{"title":"Identity-based threshold (multi) signature with private accountability for privacy-preserving blockchain","authors":"Jing Tian , Yanqi Zhao , Xiaoyi Yang , Xuan Zhao , Ruonan Chen , Yong Yu","doi":"10.1016/j.hcc.2024.100271","DOIUrl":"10.1016/j.hcc.2024.100271","url":null,"abstract":"<div><div>Identity-based threshold signature (IDTHS) allows a threshold number of signers to generate signatures to improve the deterministic wallet in the blockchain. However, the IDTHS scheme cannot determine the identity of malicious signers in case of misinformation. To solve this challenge, we propose an identity-based threshold (multi) signature with private accountability (for short AIDTHS) for privacy-preserving blockchain. From the public perspective, AIDTHS is completely private and no user knows who participated in generating the signature. At the same time, when there is a problem with the transaction, a trace entity can trace and be accountable to the signers. We formally define the syntax and security model of AIDTHS. To address the issue of identifying malicious signers, we improve upon traditional identity-based threshold signatures by incorporating zero-knowledge proofs as part of the signature and leveraging a tracer holding tracing keys to identify all signers. Additionally, to protect the privacy of signers, the signature is no longer achievable by anyone, which requires a combiner holding the keys to produce a valid signature. We give a concrete construction of AIDTHS and prove its security. Finally, we implement the AIDTHS scheme and compare it with existing schemes. The key distribution algorithm of AIDTHS takes 34.60 <span><math><mrow><mi>μ</mi><mi>s</mi></mrow></math></span> and the signature algorithm takes 13.04 ms. The verification algorithm takes 1 <span><math><mi>s</mi></math></span>, which is one-third of the time the TAPS scheme uses.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 4","pages":"Article 100271"},"PeriodicalIF":3.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142658232","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

Navigating the Digital Twin Network landscape: A survey on architecture, applications, privacy and security 数字孪生网络景观导航：架构、应用、隐私和安全调查

IF 3.2

High-Confidence Computing Pub Date : 2024-09-11 DOI: 10.1016/j.hcc.2024.100269

Akshita Maradapu Vera Venkata Sai , Chenyu Wang , Zhipeng Cai , Yingshu Li

{"title":"Navigating the Digital Twin Network landscape: A survey on architecture, applications, privacy and security","authors":"Akshita Maradapu Vera Venkata Sai , Chenyu Wang , Zhipeng Cai , Yingshu Li","doi":"10.1016/j.hcc.2024.100269","DOIUrl":"10.1016/j.hcc.2024.100269","url":null,"abstract":"<div><div>In recent years, immense developments have occurred in the field of Artificial Intelligence (AI) and the spread of broadband and ubiquitous connectivity technologies. This has led to the development and commercialization of Digital Twin (DT) technology. The widespread adoption of DT has resulted in a new network paradigm called Digital Twin Networks (DTNs), which orchestrate through the networks of ubiquitous DTs and their corresponding physical assets. DTNs create virtual twins of physical objects via DT technology and realize the co-evolution between physical and virtual spaces through data processing, computing, and DT modeling. The high volume of user data and the ubiquitous communication systems in DTNs come with their own set of challenges. The most serious issue here is with respect to user data privacy and security because users of most applications are unaware of the data that they are sharing with these platforms and are naive in understanding the implications of the data breaches. Also, currently, there is not enough literature that focuses on privacy and security issues in DTN applications. In this survey, we first provide a clear idea of the components of DTNs and the common metrics used in literature to assess their performance. Next, we offer a standard network model that applies to most DTN applications to provide a better understanding of DTN’s complex and interleaved communications and the respective components. We then shed light on the common applications where DTNs have been adapted heavily and the privacy and security issues arising from the DTNs. We also provide different privacy and security countermeasures to address the previously mentioned issues in DTNs and list some state-of-the-art tools to mitigate the issues. Finally, we provide some open research issues and problems in the field of DTN privacy and security.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 4","pages":"Article 100269"},"PeriodicalIF":3.2,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142532066","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

Erratum to “An effective digital audio watermarking using a deep convolutional neural network with a search location optimization algorithm for improvement in Robustness and Imperceptibility” [High-Confid. Comput. 3 (2023) 100153] 对 "利用深度卷积神经网络和搜索位置优化算法改进鲁棒性和不可感知性的有效数字音频水印 "的勘误 [High-Confid. Comput.

IF 3.2

High-Confidence Computing Pub Date : 2024-09-01 DOI: 10.1016/j.hcc.2024.100256

Abhijit J. Patil , Ramesh Shelke

引用次数: 0

Dynamic assessment approach for intelligent power distribution systems based on runtime verification with requirements updates 基于运行时验证和需求更新的智能配电系统动态评估方法

IF 3.2

High-Confidence Computing Pub Date : 2024-07-09 DOI: 10.1016/j.hcc.2024.100255

Yunshuo Li , Xiangjun Duan , Yuanyuan Xu , Cheng Zhao

{"title":"Dynamic assessment approach for intelligent power distribution systems based on runtime verification with requirements updates","authors":"Yunshuo Li , Xiangjun Duan , Yuanyuan Xu , Cheng Zhao","doi":"10.1016/j.hcc.2024.100255","DOIUrl":"10.1016/j.hcc.2024.100255","url":null,"abstract":"<div><div>The study aims to address the challenge of dynamic assessment in power systems by proposing a design scheme for an intelligent adaptive power distribution system based on runtime verification. The system architecture is built upon cloud–edge-end collaboration, enabling comprehensive monitoring and precise management of the power grid through coordinated efforts across different levels. Specifically, the study employs the adaptive observer approach, allowing dynamic adjustments to observers to reflect updates in requirements and ensure system reliability. This method covers both structural and parametric adjustments to specifications, including updating time protection conditions, updating events, and adding or removing responses. The results demonstrate that with the implementation of adaptive observers, the system becomes more flexible in responding to changes, significantly enhancing its level of efficiency. By employing dynamically changing verification specifications, the system achieves real-time and flexible verification. This research provides technical support for the safe, efficient, and reliable operation of electrical power distribution systems.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 2","pages":"Article 100255"},"PeriodicalIF":3.2,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141691678","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A lightweight practical consensus mechanism for supply chain blockchain

IF 3.2

High-Confidence Computing Pub Date : 2024-06-28 DOI: 10.1016/j.hcc.2024.100253

Mohammad Saidur Rahman , Ibrahim Khalil , Mohammed Atiquzzaman , Abdelaziz Bouras

{"title":"A lightweight practical consensus mechanism for supply chain blockchain","authors":"Mohammad Saidur Rahman , Ibrahim Khalil , Mohammed Atiquzzaman , Abdelaziz Bouras","doi":"10.1016/j.hcc.2024.100253","DOIUrl":"10.1016/j.hcc.2024.100253","url":null,"abstract":"<div><div>We present a consensus mechanism in this paper that is designed specifically for supply chain blockchains, with a core focus on establishing trust among participating stakeholders through a novel reputation-based approach. The prevailing consensus mechanisms, initially crafted for cryptocurrency applications, prove unsuitable for the unique dynamics of supply chain systems. Unlike the broad inclusivity of cryptocurrency networks, our proposed mechanism insists on stakeholder participation rooted in process-specific quality criteria. The delineation of roles for supply chain participants within the consensus process becomes paramount. While reputation serves as a well-established quality parameter in various domains, its nuanced impact on non-cryptocurrency consensus mechanisms remains uncharted territory. Moreover, recognizing the primary role of efficient block verification in blockchain-enabled supply chains, our work introduces a comprehensive reputation model. This model strategically selects a <em>leader node</em> to orchestrate the entire block mining process within the consensus. Additionally, we innovate with a Schnorr Multisignature-based block verification mechanism seamlessly integrated into our proposed consensus model. Rigorous experiments are conducted to evaluate the performance and feasibility of our pioneering consensus mechanism, contributing valuable insights to the evolving landscape of blockchain technology in supply chain applications.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"5 1","pages":"Article 100253"},"PeriodicalIF":3.2,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143102311","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