信息工程最新文献

{"title":"Empowering autonomous IoT devices in blockchain through gasless transactions","authors":"Yash Madhwal ,&nbsp;Yury Yanovich ,&nbsp;Aleksandra Korotkevich ,&nbsp;Daria Parshina ,&nbsp;Nshteh Seropian ,&nbsp;Stepan Gavrilov ,&nbsp;Alex Nikolaev ,&nbsp;S. Balachander ,&nbsp;A. Murugan","doi":"10.1016/j.bcra.2024.100257","DOIUrl":"10.1016/j.bcra.2024.100257","url":null,"abstract":"<div><div>The article introduces a proof-of-concept (PoC) that demonstrates the management of Internet of Things (IoT) devices' infrastructure via smart contracts, facilitating their interaction with the blockchain through gasless transactions. The focus is empowering IoT devices to autonomously sign transactions using their verified private keys, eliminating the necessity for external wallets and enabling blockchain interaction using Biconomy without incurring gas fees. In this PoC, managers can validate IoT devices, permitting them to transmit transactions securely without being able to manipulate measurements or risking losing crypto assets in case of hardware malfunctions. This innovative method ensures that devices with minimal funds can access sensor data and communicate with a smart contract on the blockchain to update information utilizing account abstraction. Detailed workflow and simulation results are provided to showcase the practicality and advantages of this approach in scenarios demanding seamless automated blockchain engagement through IoT devices. The PoC code is openly accessible on GitHub, enhancing the transparency and accessibility of our research outcomes.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 2","pages":"Article 100257"},"PeriodicalIF":6.9,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084296","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"πFL: Private, atomic, incentive mechanism for federated learning based on blockchain","authors":"Kejia Chen ,&nbsp;Jiawen Zhang ,&nbsp;Xuanming Liu ,&nbsp;Zunlei Feng ,&nbsp;Xiaohu Yang","doi":"10.1016/j.bcra.2024.100271","DOIUrl":"10.1016/j.bcra.2024.100271","url":null,"abstract":"<div><div>Federated learning (FL) is predicated on the provision of high-quality data by multiple clients, which is then used to train global models. A plethora of incentive mechanism studies have been conducted with the objective of promoting the provision of high-quality data by clients. These studies have focused on the distribution of benefits to clients. However, the incentives of federated learning are transactional in nature, and the issue of the atomicity of transactions has not been addressed. Furthermore, the data quality of individual clients participating in training varies, and they may participate negatively in training out of privacy leakage concerns.</div><div>Consequently, we propose an inaugural atomistic incentive scheme with privacy preservation in the FL setting: <em>π</em>FL (<strong>p</strong>rivacy, <strong>a</strong>tomic, <strong>i</strong>ncentive). This scheme establishes a more dependable training environment based on Shapley valuation, secure multi-party computation, and smart contracts. Consequently, it ensures that each client's contribution can be accurately measured and appropriately rewarded, improves the accuracy and efficiency of model training, and enhances the sustainability and reliability of the FL system. The efficacy of this mechanism has been demonstrated through comprehensive experimental analysis. It is evident that this mechanism not only protects the privacy of trainers and provides atomic training rewards but also improves the model performance of FL, with an accuracy improvement of at least 8%.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 2","pages":"Article 100271"},"PeriodicalIF":6.9,"publicationDate":"2025-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144146941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"To healthier Ethereum: a comprehensive and iterative smart contract weakness enumeration","authors":"Jiachi Chen,&nbsp;Mingyuan Huang,&nbsp;Zewei Lin,&nbsp;Peilin Zheng,&nbsp;Zibin Zheng","doi":"10.1016/j.bcra.2024.100258","DOIUrl":"10.1016/j.bcra.2024.100258","url":null,"abstract":"<div><div>With the increasing popularity of cryptocurrencies and blockchain technologies, smart contracts have become a prominent feature in developing decentralized applications. However, these smart contracts are susceptible to vulnerabilities that hackers can exploit, resulting in significant financial losses. In response to this growing concern, various initiatives have emerged. Notably, the Smart Contract Weakness Classification (SWC) list plays an important role in raising awareness and understanding of smart contract weaknesses. However, the SWC list lacks maintenance and has not been updated with new vulnerabilities since 2020. To address this gap, this paper introduces the Smart Contract Weakness Enumeration (SWE), a comprehensive and practical vulnerability list up until 2023. We collect 273 vulnerability descriptions from 86 top conference papers and journal papers, employing the open card-sorting method to deduplicate and categorize these descriptions. This process results in the identification of 40 common contract weaknesses, which are further classified into 20 sub-research fields through thorough discussion and analysis. The SWE provides a systematic and comprehensive list of smart contract vulnerabilities, covering existing and emerging vulnerabilities in the last few years. Moreover, the SWE is a scalable and continuously iterative program. We propose two update mechanisms for the maintenance of the SWE. Regular updates involve the inclusion of new vulnerabilities from future top papers, while irregular updates enable individuals to report new weaknesses for review and potential addition to the SWE.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 2","pages":"Article 100258"},"PeriodicalIF":6.9,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144084297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Network synchronizability enhancement via adding antagonistic interactions","authors":"Yue Song,&nbsp;Xiaoqin Liu,&nbsp;Dingmei Wang,&nbsp;Pengfei Gao,&nbsp;Mengqi Xue","doi":"10.1007/s43684-024-00086-6","DOIUrl":"10.1007/s43684-024-00086-6","url":null,"abstract":"<div><p>We discover a “less-is-more” effect that adding local antagonistic interactions (negative edge weights) can enhance the overall synchronizability of a dynamical network system. To explain this seemingly counterintuitive phenomenon, a condition is established to identify those edges the weight reduction of which improves the synchronizability index of the underlying network. We further reveal that this condition can be interpreted from the perspective of resistance distance and network community structure. The obtained result is also verified via numerical experiments on a 14-node network and a 118-node network. Our finding brings new thoughts and inspirations to the future directions of optimal network design problems.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00086-6.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142906061","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}

{"title":"Distributed strategies for pursuit-evasion of high-order integrators","authors":"Panpan Zhou,&nbsp;Yueyue Xu,&nbsp;Bo Wahlberg,&nbsp;Xiaoming Hu","doi":"10.1007/s43684-024-00085-7","DOIUrl":"10.1007/s43684-024-00085-7","url":null,"abstract":"<div><p>This paper presents decentralized solutions for pursuit-evasion problems involving high-order integrators with intracoalition cooperation and intercoalition confrontation. Distinct error variables and hyper-variables are introduced to ensure the control strategies to be independent of the relative velocities, accelerations and higher order information of neighbors. Consequently, our approach only requires agents to exchange position information or to measure the relative positions of the neighbors. The distributed strategies take into consideration the goals of intracoalition cooperation or intercoalition confrontation of the players. Furthermore, after establishing a sufficient and necessary condition for a class of high-order integrators, we present conditions for capture and formation control with exponential convergence for three scenarios: one-pursuer-one-evader, multiple-pursuer-one-evader, and multiple-pursuer-multiple-evader. It is shown that the conditions depend on the structure of the communication graph, the weights in the control law, and the expected formation configuration. Finally, the effectiveness of the proposed algorithm is demonstrated through simulation results.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00085-7.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142889926","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}

{"title":"Unveiling smart contract vulnerabilities: Toward profiling smart contract vulnerabilities using enhanced genetic algorithm and generating benchmark dataset","authors":"Sepideh HajiHosseinKhani ,&nbsp;Arash Habibi Lashkari ,&nbsp;Ali Mizani Oskui","doi":"10.1016/j.bcra.2024.100253","DOIUrl":"10.1016/j.bcra.2024.100253","url":null,"abstract":"<div><div>With the advent of blockchain networks, there has been a transition from traditional contracts to Smart Contracts (SCs), which are crucial for maintaining trust within these networks. Previous methods for analyzing SCs vulnerabilities typically suffer from a lack of accuracy and effectiveness. Many of them, such as rule-based methods, machine learning techniques, and neural networks, also struggle to detect complex vulnerabilities due to limited data availability. This study introduces a novel approach to detecting, identifying, and profiling SC vulnerabilities, comprising two key components: an updated analyzer named SCsVulLyzer (V2.0) and an advanced Genetic Algorithm (GA) profiling method. The analyzer extracts 240 features across different categories, while the enhanced GA, explicitly designed for profiling SC vulnerabilities, employs techniques such as penalty fitness function, retention of elites, and adaptive mutation rate to create a detailed profile for each vulnerability. Furthermore, due to the lack of comprehensive validation and evaluation datasets with sufficient samples and diverse vulnerabilities, this work introduces a new dataset named BCCC-SCsVul-2024. This dataset consists of 111,897 Solidity source code samples, ensuring the practical validation of the proposed approach. Additionally, three types of taxonomies are established, covering SC literature review, profiling techniques, and feature extraction. These taxonomies offer a systematic classification and analysis of information, enhancing the efficiency of the proposed profiling technique. Our proposed approach demonstrated superior capabilities with higher precision and accuracy through rigorous testing and experimentation. It not only showed excellent results for evaluation parameters but also proved highly efficient in terms of time and space complexity. Moreover, the concept of the profiling technique makes our model highly transparent and explainable. These promising results highlight the potential of GA-based profiling to improve the detection and identification of SC vulnerabilities, contributing to enhanced security in blockchain networks.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 2","pages":"Article 100253"},"PeriodicalIF":6.9,"publicationDate":"2024-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143878422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adherence to biosafety and biosecurity protocols: An assessment of biomedical and veterinary laboratories in Benin","authors":"Philippe Sessou ,&nbsp;Nestor Noudeke ,&nbsp;Yves Eric Denon ,&nbsp;Aretas Tonouhewa ,&nbsp;Alban Zohoun ,&nbsp;Nassirou Boukary ,&nbsp;Désirée Metodakou ,&nbsp;Brian Samuelson ,&nbsp;Dana Hag Hamed ,&nbsp;Jenny Zhao ,&nbsp;Sumegha Asthana ,&nbsp;Mohammed Abid ,&nbsp;Erin M. Sorrell","doi":"10.1016/j.jobb.2024.11.001","DOIUrl":"10.1016/j.jobb.2024.11.001","url":null,"abstract":"<div><div>Diagnostic laboratories play a crucial role in surveillance and epidemic preparedness. However, gaps in adherence to biosecurity and biosafety protocols in managing, isolating, storing, and disposing of infectious pathogens in these facilities pose a serious risk to the laboratory, local populations, and the surrounding environment. In this study, we evaluated adherence to biosecurity and biosafety protocols in 96 public and private biomedical and veterinary laboratories in Benin to identify and address such gaps. We followed a cross-sectional study design. We used the Biosafety and Biosecurity in Laboratory Tool to assess biomedical laboratories and the Laboratory Mapping Tool to assess veterinary laboratories. Data were collected using KoBoCollect and analyzed with R software version 4.0.5. Descriptive analysis, the chi-squared test, and logistic regression were used to analyze the data. The findings revealed that most laboratories did not comply with established guidelines. Of all laboratories surveyed, 42% presented a very high risk, 38% a high risk, 15% moderate risk, and 5% were low risk. Overall, 80% of biomedical laboratories and 100% of veterinary laboratories were rated high risk. To improve effective biosecurity practices in laboratories in Benin to an acceptable standard, it is essential to implement robust biosecurity and biosafety policies. Additionally, capacity-building sessions should be conducted for laboratory staff and managers to educate them on the latest biosecurity protocols.</div></div>","PeriodicalId":52875,"journal":{"name":"Journal of Biosafety and Biosecurity","volume":"7 1","pages":"Pages 28-37"},"PeriodicalIF":0.0,"publicationDate":"2024-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143096735","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}

{"title":"Coordinating REST interactions in service choreographies using blockchain","authors":"Francesco Donini ,&nbsp;Alessandro Marcelletti ,&nbsp;Andrea Morichetta ,&nbsp;Andrea Polini","doi":"10.1016/j.bcra.2024.100241","DOIUrl":"10.1016/j.bcra.2024.100241","url":null,"abstract":"<div><div>In Service Oriented Computing (SOC), different services interact and exchange information to reach specific objectives. To model interorganizational SOC systems, choreography modeling languages have emerged to represent the distributed coordination among the involved organizations. From the realization perspective, blockchain technology is emerging as a promising run-time supporting peer-to-peer communication technology without the need for a central coordinator, thanks to its intrinsic security, trust, and decentralization characteristics. However, while blockchain can bring many advantages, technological barriers still limit its adoption in organizations, due to the costly and time-consuming learning process. For this reason, we propose RESTChain, a framework that automatically enables the interactions that take place among the participants in a service choreography exploiting blockchain technology. Starting from a choreography specification, the framework provides a set of mediators and automatically generates a smart contract that coordinates the service interactions. The mediators are software components that are directly connected with the smart contracts and expose REpresentational State Transfer (REST) APIs in compliance with the role played by the organizations in the choreography. In this way, the services deployed by one organization can communicate with the services made available by another organization through the blockchain in a secure and transparent manner. The proposed approach has been implemented on the Layer 2 Polygon blockchain and validated in a market retail case study analyzing its efficiency in terms of time and cost.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100241"},"PeriodicalIF":6.9,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143100649","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An intelligent surface roughness prediction method based on automatic feature extraction and adaptive data fusion","authors":"Xun Zhang,&nbsp;Sibao Wang,&nbsp;Fangrui Gao,&nbsp;Hao Wang,&nbsp;Haoyu Wu,&nbsp;Ying Liu","doi":"10.1007/s43684-024-00083-9","DOIUrl":"10.1007/s43684-024-00083-9","url":null,"abstract":"<div><p>Machining quality prediction based on cutting big data is the core focus of current developments in intelligent manufacturing. Presently, predictions of machining quality primarily rely on process and signal analyses. Process-based predictions are generally constrained to the development of rudimentary regression models. Signal-based predictions often require large amounts of data, multiple processing steps (such as noise reduction, principal component analysis, modulation, etc.), and have low prediction efficiency. In addition, the accuracy of the model depends on tedious manual parameter tuning. This paper proposes a convolutional neural network quality intelligent prediction model based on automatic feature extraction and adaptive data fusion (CNN-AFEADF). Firstly, by processing signals from multiple directions, time-frequency domain images with rich features can be obtained, which significantly benefit neural network learning. Secondly, the corresponding images in three directions are fused into one image by setting different fusion weight parameters. The optimal fusion weight parameters and window length are determined by the Particle Swarm Optimization algorithm (PSO). This data fusion method reduces training time by 16.74 times. Finally, the proposed method is verified by various experiments. This method can automatically identify sensitive data features through neural network fitting experiments and optimization, thereby eliminating the need for expert experience in determining the significance of data features. Based on this approach, the model achieves an average relative error of 2.95%, reducing the prediction error compared to traditional models. Furthermore, this method enhances the intelligent machining level.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00083-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142811308","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}

{"title":"Safe motion planning and formation control of quadruped robots","authors":"Zongrui Ji,&nbsp;Yi Dong","doi":"10.1007/s43684-024-00084-8","DOIUrl":"10.1007/s43684-024-00084-8","url":null,"abstract":"<div><p>This paper introduces a motion planning and cooperative formation control approach for quadruped robots and multi-agent systems. First, in order to improve the efficiency and safety of quadruped robots navigating in complex environments, this paper proposes a new planning method that combines the dynamic model of quadruped robots and a gradient-optimized obstacle avoidance strategy without Euclidean Signed Distance Field. The framework is suitable for both static and slow dynamic obstacle environments, aiming to achieve multiple goals of obstacle avoidance, minimizing energy consumption, reducing impact, satisfying dynamic constraints, and ensuring trajectory smoothness. This approach differs in that it reduces energy consumption throughout the movement from a new perspective. Meanwhile, this method effectively reduces the impact of the ground on the robot, thus mitigating the damage to its structure. Second, we combine the dynamic control barrier function and the virtual leader-follower model to achieve efficient and safe formation control through model predictive control. Finally, the proposed algorithm is validated through both simulations and real-world scenarios testing.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"4 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-024-00084-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142778519","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}