High-Confidence Computing最新文献_第6页

An investigation of the private-attribute leakage in WiFi sensing 对 WiFi 传感中私人属性泄露的调查

IF 3.2

High-Confidence Computing Pub Date : 2024-02-03 DOI: 10.1016/j.hcc.2024.100209

引用次数: 0

H-hop independently submodular maximization problem with curvature 有曲率的 H 跳独立亚模态最大化问题

High-Confidence Computing Pub Date : 2024-02-02 DOI: 10.1016/j.hcc.2024.100208

Yang Lv , Chenchen Wu , Dachuan Xu , Ruiqi Yang

{"title":"H-hop independently submodular maximization problem with curvature","authors":"Yang Lv , Chenchen Wu , Dachuan Xu , Ruiqi Yang","doi":"10.1016/j.hcc.2024.100208","DOIUrl":"10.1016/j.hcc.2024.100208","url":null,"abstract":"<div><p>The Connected Sensor Problem (CSP) presents a prevalent challenge in the realms of communication and Internet of Things (IoT) applications. Its primary aim is to maximize the coverage of users while maintaining connectivity among <em>K</em> sensors. Addressing the challenge of managing a large user base alongside a finite number of candidate locations, this paper proposes an extension to the CSP: the h-hop independently submodular maximization problem characterized by curvature <span><math><mi>α</mi></math></span>. We have developed an approximation algorithm that achieves a ratio of <span><math><mfrac><mrow><mn>1</mn><mo>−</mo><msup><mrow><mi>e</mi></mrow><mrow><mo>−</mo><mi>α</mi></mrow></msup></mrow><mrow><mrow><mo>(</mo><mn>2</mn><mi>h</mi><mo>+</mo><mn>3</mn><mo>)</mo></mrow><mi>α</mi></mrow></mfrac></math></span>. The efficacy of this algorithm is demonstrated on the CSP, where it shows superior performance over existing algorithms, marked by an average enhancement of 8.4%.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100208"},"PeriodicalIF":0.0,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000114/pdfft?md5=6545def2e75a2c91befd56e66f41423d&pid=1-s2.0-S2667295224000114-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139818439","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

Bioinvasion risk analysis based on automatic identification system and marine ecoregion data 基于自动识别系统和海洋生态区数据的生物入侵风险分析

IF 3.2

High-Confidence Computing Pub Date : 2024-02-02 DOI: 10.1016/j.hcc.2024.100210

Hongwei Shi , Chenyu Wang , Hang Zhao , Shengling Wang , Yixian Chen

{"title":"Bioinvasion risk analysis based on automatic identification system and marine ecoregion data","authors":"Hongwei Shi , Chenyu Wang , Hang Zhao , Shengling Wang , Yixian Chen","doi":"10.1016/j.hcc.2024.100210","DOIUrl":"10.1016/j.hcc.2024.100210","url":null,"abstract":"<div><div>The global maritime trade plays a key role in propagating alien aquatic invasive species, which incurs side effects in terms of environment, human health and economy. The existing biosecurity methods did not take into account the invaded risk as well as the diffusion of invasive species at the same time, which may lead to inadequate bioinvasion control. In addition, the lack of considering the impact of bioinvasion control on shipping also makes their methods cost-ineffective. To solve the problems of the existing methods, we employ the automatic identification system (AIS) data, the ballast water data and the water temperature & salinity data to construct two networks: the species invasion network (SIN) and the global shipping network (GSN). The former is used to analyze the potential of a port in propagating marine invasive species while the latter is employed to evaluate the shipping importance of ports. Based on the analysis of SIN and GSN, two categories of biosecurity triggering mechanisms are proposed. The first category takes into consideration both being bioinvaded and spreading invasive species and the second one concerns the shipping value of each port besides its invasion risk. A lot of case studies have been done to discover the key ports needed to be controlled preferentially under the guide of the proposed biosecurity triggering mechanisms. Finally, our correlation analysis shows that closeness is most highly correlated to the invasion risk.</div></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 4","pages":"Article 100210"},"PeriodicalIF":3.2,"publicationDate":"2024-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139816780","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

Traffic anomaly detection algorithm for CAN bus using similarity analysis 使用相似性分析的 CAN 总线流量异常检测算法

IF 3.2

High-Confidence Computing Pub Date : 2024-01-24 DOI: 10.1016/j.hcc.2024.100207

{"title":"Traffic anomaly detection algorithm for CAN bus using similarity analysis","authors":"","doi":"10.1016/j.hcc.2024.100207","DOIUrl":"10.1016/j.hcc.2024.100207","url":null,"abstract":"<div><p>Recently, vehicles have experienced a rise in networking and informatization, leading to increased security concerns. As the most widely used automotive bus network, the Controller Area Network (CAN) bus is vulnerable to attacks, as security was not considered in its original design. This paper proposes SIDuBzip2, a traffic anomaly detection method for the CAN bus based on the bzip2 compression algorithm. The proposed method utilizes the pseudo-periodic characteristics of CAN bus traffic, constructing time series of CAN IDs and calculating the similarity between adjacent time series to identify abnormal traffic. The method consists of three parts: the conversion of CAN ID values to characters, the calculation of similarity based on bzip2 compression, and the optimal solution of model parameters. The experimental results demonstrate that the proposed SIDuBzip2 method effectively detects various attacks, including Denial of Service , replay, basic injection, mixed injection, and suppression attacks. In addition, existing CAN bus traffic anomaly detection methods are compared with the proposed method in terms of performance and delay, demonstrating the feasibility of the proposed method.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100207"},"PeriodicalIF":3.2,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000102/pdfft?md5=b2ff302140dd063117041177fe6d1399&pid=1-s2.0-S2667295224000102-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139631378","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

Secure blockchain bidding auction protocol against malicious adversaries 抵御恶意对手的安全区块链竞价拍卖协议

High-Confidence Computing Pub Date : 2024-01-11 DOI: 10.1016/j.hcc.2024.100201

Xiaobing Dai , Jiajing Liu , Xin Liu , Xiaofen Tu , Ruexue Wang

{"title":"Secure blockchain bidding auction protocol against malicious adversaries","authors":"Xiaobing Dai , Jiajing Liu , Xin Liu , Xiaofen Tu , Ruexue Wang","doi":"10.1016/j.hcc.2024.100201","DOIUrl":"10.1016/j.hcc.2024.100201","url":null,"abstract":"<div><p>In recent years, with the development of blockchain, electronic bidding auction has received more and more attention. Aiming at the possible problems of privacy leakage in the current electronic bidding and auction, this paper proposes an electronic bidding auction system based on blockchain against malicious adversaries, which uses the secure multi-party computation to realize secure bidding auction protocol without any trusted third party. The protocol proposed in this paper is an electronic bidding auction scheme based on the threshold elliptic curve cryptography. It can be implemented without any third party to complete the bidding auction for some malicious behaviors of the participants, which can solve the problem of resisting malicious adversary attacks. The security of the protocol is proved by the real/ideal model paradigm, and the efficiency of the protocol is analyzed. The efficiency of the protocol is verified by simulating experiments, and the protocol has practical value.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100201"},"PeriodicalIF":0.0,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000047/pdfft?md5=319168477025da7fd78f5308eb341778&pid=1-s2.0-S2667295224000047-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139635497","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 cognitive spectrum allocation scheme for data transmission in smart distribution grids 用于智能配电网数据传输的认知频谱分配方案

High-Confidence Computing Pub Date : 2024-01-11 DOI: 10.1016/j.hcc.2024.100198

Zhongguo Zhou , You Li , Ziming Zhu , Qinghe Gao , Sisi Xiao , Tao Yan , Yan Huo

{"title":"A cognitive spectrum allocation scheme for data transmission in smart distribution grids","authors":"Zhongguo Zhou , You Li , Ziming Zhu , Qinghe Gao , Sisi Xiao , Tao Yan , Yan Huo","doi":"10.1016/j.hcc.2024.100198","DOIUrl":"10.1016/j.hcc.2024.100198","url":null,"abstract":"<div><p>As the communication needs in the smart distribution grid continue to rise, using existing resources to meet this growing demand poses a significant challenge. This paper researches on spectrum allocation strategies utilizing cognitive radio (CR) technology. We consider a model containing strong time-sensitive and regular communication service requirements such as distribution terminal communication services, which can be seen as a user with primary data (PD) and weak time-sensitive services such as power quality monitoring, which can be seen as a user with secondary data (SD). To fit the diversity of services in smart distribution grids (SDGs), we formulate an optimization problem with two indicators, including the sum of SD transmission rates and the maximum latency of them. Then, we analyze the two convex sub-problems and utilize convex optimization methods to obtain the optimal power and frequency bandwidth allocation for the users with SD. The simulation results indicate that, when the available transmission power of SD is low, <em>Maximization of Transmission Sum Rate</em> (MTSR) achieves lower maximum transmit time. Conversely, when the available transmission power is high, the performance of <em>Minimization of the Maximum Latency</em> (MML) is better, compared with MTSR.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100198"},"PeriodicalIF":0.0,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000011/pdfft?md5=1b5e9cb9577d5d4bd670a7738919fe96&pid=1-s2.0-S2667295224000011-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139632186","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 survey of fault tolerant consensus in wireless networks 无线网络容错共识调查

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

Yifei Zou , Li Yang , Guanlin Jing , Ruirui Zhang , Zhenzhen Xie , Huiqun Li , Dongxiao Yu

{"title":"A survey of fault tolerant consensus in wireless networks","authors":"Yifei Zou , Li Yang , Guanlin Jing , Ruirui Zhang , Zhenzhen Xie , Huiqun Li , Dongxiao Yu","doi":"10.1016/j.hcc.2024.100202","DOIUrl":"10.1016/j.hcc.2024.100202","url":null,"abstract":"<div><p>Wireless networks have become integral to modern communication systems, enabling the seamless exchange of information across a myriad of applications. However, the inherent characteristics of wireless channels, such as fading, interference, and openness, pose significant challenges to achieving fault-tolerant consensus within these networks. Fault-tolerant consensus, a critical aspect of distributed systems, ensures that network nodes collectively agree on a consistent value even in the presence of faulty or compromised components. This survey paper provides a comprehensive overview of fault-tolerant consensus mechanisms specifically tailored for wireless networks. We explore the diverse range of consensus protocols and techniques that have been developed to address the unique challenges of wireless environments. The paper systematically categorizes these consensus mechanisms based on their underlying principles, communication models, and fault models. It investigates how these mechanisms handle various types of faults, including communication errors, node failures, and malicious attacks. It highlights key use cases, such as sensor networks, Internet of Things (IoT) applications, wireless blockchain, and vehicular networks, where fault-tolerant consensus plays a pivotal role in ensuring reliable and accurate data dissemination.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 2","pages":"Article 100202"},"PeriodicalIF":0.0,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000059/pdfft?md5=7d04cf1493be0e5575ab310a74881d83&pid=1-s2.0-S2667295224000059-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139457898","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

Outlier item detection in bundle recommendation via the attention mechanism 通过关注机制检测捆绑推荐中的异常项目

High-Confidence Computing Pub Date : 2024-01-05 DOI: 10.1016/j.hcc.2024.100200

Yuan Liang

{"title":"Outlier item detection in bundle recommendation via the attention mechanism","authors":"Yuan Liang","doi":"10.1016/j.hcc.2024.100200","DOIUrl":"10.1016/j.hcc.2024.100200","url":null,"abstract":"<div><p>Bundle recommendation offers users more holistic insights by recommending multiple compatible items at once. However, the intricate correlations between items, varied user preferences, and the pronounced data sparsity in combinations present significant challenges for bundle recommendation algorithms. Furthermore, current bundle recommendation methods fail to identify mismatched items within a given set, a process termed as “outlier item detection”. These outlier items are those with the weakest correlations within a bundle. Identifying them can aid users in refining their item combinations. While the correlation among items can predict the detection of such outliers, the adaptability of combinations might not be adequately responsive to shifts in individual items during the learning phase. This limitation can hinder the algorithm’s performance. To tackle these challenges, we introduce an encoder–decoder architecture tailored for outlier item detection. The encoder learns potential item correlations through a self-attention mechanism. Concurrently, the decoder garners efficient inference frameworks by directly assessing item anomalies. We have validated the efficacy and efficiency of our proposed algorithm using real-world datasets.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100200"},"PeriodicalIF":0.0,"publicationDate":"2024-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295224000035/pdfft?md5=efa091405aad1bbcc69d7febeec7012b&pid=1-s2.0-S2667295224000035-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139393106","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

Food safety testing by negentropy-sorted kernel independent component analysis based on infrared spectroscopy 基于红外光谱的负熵排序核独立成分分析法进行食品安全检测

High-Confidence Computing Pub Date : 2023-12-28 DOI: 10.1016/j.hcc.2023.100197

Jing Liu, Limiao Deng, Zhongzhi Han

{"title":"Food safety testing by negentropy-sorted kernel independent component analysis based on infrared spectroscopy","authors":"Jing Liu, Limiao Deng, Zhongzhi Han","doi":"10.1016/j.hcc.2023.100197","DOIUrl":"10.1016/j.hcc.2023.100197","url":null,"abstract":"<div><p>In the field of food safety testing, variety, brand, origin, and adulteration are four important factors. In this study, a novel food safety testing method based on infrared spectroscopy is proposed to investigate these factors. Fourier transform infrared spectroscopy data are analyzed using negentropy-sorted kernel independent component analysis (NS-kICA) as the feature optimization method. To rank the components, negentropy is performed to measure the non-Gaussian independent components. In our experiment, the proposed method was run on four datasets to comprehensively investigate the variety, brand, origin, and adulteration of agricultural products. The experimental results show that NS-kICA outperforms conventional feature selection methods. The support vector machine model outperforms the backpropagation artificial neural network and partial least squares models. The combination of NS-kICA and support vector machine (SVM) is the best method for achieving high, stable, and efficient recognition performance. These findings are of great importance for food safety testing.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100197"},"PeriodicalIF":0.0,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295223000958/pdfft?md5=b8bd33e2cea03cbd8890ca8538dee20c&pid=1-s2.0-S2667295223000958-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139188126","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 hierarchical byzantine fault tolerance consensus protocol for the Internet of Things 面向物联网的分层拜占庭容错共识协议

IF 3.2

High-Confidence Computing Pub Date : 2023-12-20 DOI: 10.1016/j.hcc.2023.100196

Rongxin Guo , Zhenping Guo , Zerui Lin , Wenxian Jiang

{"title":"A hierarchical byzantine fault tolerance consensus protocol for the Internet of Things","authors":"Rongxin Guo , Zhenping Guo , Zerui Lin , Wenxian Jiang","doi":"10.1016/j.hcc.2023.100196","DOIUrl":"10.1016/j.hcc.2023.100196","url":null,"abstract":"<div><p>The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development. To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance (PBFT) in IoT scenarios, a hierarchical consensus protocol called DCBFT is proposed. Above all, we propose an improved k-sums algorithm to build a two-level consensus cluster, achieving an hierarchical management for IoT devices. Next, A scalable two-level consensus protocol is proposed, which uses a multi-primary node mechanism to solve the single-point-of-failure problem. In addition, a data synchronization process is introduced to ensure the consistency of block data after view changes. Finally, A dynamic reputation evaluation model is introduced to update the nodes’ reputation values and complete the rotation of consensus nodes at the end of each consensus round. The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency. Moreover, After running for some time, the performance of DCBFT shows some improvement.</p></div>","PeriodicalId":100605,"journal":{"name":"High-Confidence Computing","volume":"4 3","pages":"Article 100196"},"PeriodicalIF":3.2,"publicationDate":"2023-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2667295223000946/pdfft?md5=319d5156a64f46754b47a19c3c570818&pid=1-s2.0-S2667295223000946-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138992888","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