信息工程最新文献

{"title":"Redactable blockchain with anonymity and multi-permission for instructional management","authors":"Xiuhua Lu ,&nbsp;Jing Liu ,&nbsp;Fengyin Li ,&nbsp;Jiazheng Zou ,&nbsp;Yuhao Hou","doi":"10.1016/j.bcra.2024.100247","DOIUrl":"10.1016/j.bcra.2024.100247","url":null,"abstract":"<div><div>An instructional management system (IMS) regularly manages student data with a centralized database, which may be prone to single points of failure and data tampering. Blockchain can effectively solve the above problems due to its decentralization and immutability. However, the immutability of blockchain restricts the edit of data in some cases (e.g., incorrect score records). In this paper, we propose an advanced decentralized instructional management framework based on redactable blockchain, wherein chain nodes possess the capability to autonomously revise their initiated transactions with regular chameleon hash functions. Concurrently, system users can anonymously report discrepancies or erroneous entries within the blockchain. When such reports are validated and malicious activities are confirmed, the review team can undertake decentralized modifications to rectify the malicious content with our proposed scheme. In addition, we conduct a security analysis of the scheme, evaluating its correctness, collision resistance, and claimability. Finally, experimental results demonstrate that the scheme is practical.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100247"},"PeriodicalIF":6.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683396","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":"ATBFT-automatically switch consensus protocol","authors":"Yuxuan Lu ,&nbsp;Chang Liu ,&nbsp;Lanju Kong ,&nbsp;Xiangyu Niu","doi":"10.1016/j.bcra.2024.100255","DOIUrl":"10.1016/j.bcra.2024.100255","url":null,"abstract":"<div><div>The current blockchain requires higher stability and efficiency. However, leaderBFT consensus and leaderlessBFT consensus have three problems: dominant replica failure, transaction interruption, and high communication overhead and latency. And regardless of leaderBFT consensus or leaderlessBFT consensus, there isn't a very good solution. It's urgent to leverage the advantages of both consensus types to enhance blockchain performance. To solve the problems, this paper proposes the ATBFT consensus protocol. ATBFT elects the dominant replica through reputation value to ensure higher reliability. In addition, ATBFT has an automatic switching mechanism between leaderBFT consensus and leaderlessBFT consensus. The protocol can automatically elect the consensus type according to the current network conditions, effectively utilizing the idle time of the view change to generate more blocks. Furthermore, it can guarantee the execution of the entire consensus process to ensure that the tx<span><span>²</span></span>-transactions are uninterrupted. Finally, ATBFT decomposes the blocks: the consensus is performed only through the block header, and the commitment and execution phase of a tx is performed through a linearly propagated block body. According to experimental evaluation, ATBFT has higher usability and practicality.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100255"},"PeriodicalIF":6.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683326","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":"βFSCM: An enhanced food supply chain management system using hybrid blockchain and recommender systems","authors":"Feiyang Sun ,&nbsp;Peiyu Wang ,&nbsp;Yihan Zhang ,&nbsp;Pushpendu Kar","doi":"10.1016/j.bcra.2024.100245","DOIUrl":"10.1016/j.bcra.2024.100245","url":null,"abstract":"<div><div>Blockchain technology has gained traction in Food Supply Chain Management (FSCM), enhancing traceability and transparency. The existing deployments of public or private blockchains face issues in achieving an optimal balance between transparency and decentralization. This work proposes a hybrid blockchain model complemented by an Access Control (AC) mechanism to bolster security, reliability, and usability within FSCM systems. Furthermore, the integration of a recommender system is proposed to utilize data analytics and machine learning for personalizing product offerings and optimizing inventory management, aiming to boost efficiency and consumer satisfaction. The synergy between the hybrid blockchain framework and the recommender system is anticipated to cultivate a more engaged, efficient, and gratified supply chain ecosystem. The model significantly enhances monitoring in 30% of the use cases and supports transparency in a quarter. It also reduces vulnerability cases by 20%. Inventory management is markedly improved, reducing overstock by 25%, confirming the effectiveness of the proposed hybrid blockchain approach.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100245"},"PeriodicalIF":6.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683324","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":"D-VRE: From a Jupyter-enabled private research environment to decentralized collaborative research ecosystem","authors":"Yuandou Wang ,&nbsp;Sheejan Tripathi ,&nbsp;Siamak Farshidi ,&nbsp;Zhiming Zhao","doi":"10.1016/j.bcra.2024.100244","DOIUrl":"10.1016/j.bcra.2024.100244","url":null,"abstract":"<div><div>Today, scientific research is increasingly becoming data-centric and compute-intensive, relying on data and models across distributed sources. However, challenges still exist in the traditional cooperation mode, given the high storage and computing costs, geolocation barriers, and local confidentiality regulations. The Jupyter environment has recently emerged and evolved into a vital virtual research environment for scientific computing, which researchers can use to scale computational analyses up to larger datasets and high-performance computing resources. Nevertheless, existing approaches lack robust support of a decentralized cooperation mode to unlock the full potential of decentralized collaborative scientific research, e.g., seamlessly secure data sharing. In this work, we change the basic structure and legacy norms of current research environments via the seamless integration of Jupyter with Ethereum blockchain capabilities. As such, it creates a Decentralized Virtual Research Environment (D-VRE) from private computational notebooks to a decentralized collaborative research ecosystem. We propose a novel architecture for the D-VRE and prototype some essential D-VRE elements for enabling secure data sharing with decentralized identity, user-centric agreement-making, membership, and research asset management. To validate our method, we conduct an experimental study to test all functionalities of D-VRE smart contracts and their gas consumption. In addition, we deploy the D-VRE prototype on a test net of the Ethereum blockchain for demonstration. The feedback from the studies showcases the current prototype's usability, ease of use, and potential, and suggests further improvements.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100244"},"PeriodicalIF":6.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683323","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":"Backtesting framework for concentrated liquidity market makers on Uniswap V3 decentralized exchange","authors":"Andrey Urusov ,&nbsp;Rostislav Berezovskiy ,&nbsp;Yury Yanovich","doi":"10.1016/j.bcra.2024.100256","DOIUrl":"10.1016/j.bcra.2024.100256","url":null,"abstract":"<div><div>Decentralized Finance (DeFi) has revolutionized the financial landscape, with protocols like Uniswap offering innovative automated market-making mechanisms. This article explores the development of a backtesting framework specifically tailored for Concentrated Liquidity Market Makers (CLMMs). The focus is on leveraging the liquidity distribution approximated using a parametric model to estimate the rewards within liquidity pools. The article details the design, implementation, and insights derived from this novel approach to backtesting within the context of Uniswap V3. The developed backtester was successfully utilized to assess reward levels across several pools using historical data from 2023 (pools Uniswap V3 for pairs of altcoins, stablecoins, and USDC/ETH with different fee levels). Moreover, the error in modeling the level of rewards for the period under review for each pool was less than 1%. This demonstrated the effectiveness of the backtester in quantifying liquidity pool rewards and its potential in estimating revenues of Liquidity Provider (LP) as part of the pool rewards, which is the focus of our next research. The backtester serves as a tool to simulate trading strategies and liquidity provision scenarios, providing a quantitative assessment of potential returns for LPs. By incorporating statistical tools to mirror CLMM pool liquidity dynamics, this framework can be further leveraged for strategy enhancement and risk evaluation for LPs operating within decentralized exchanges.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100256"},"PeriodicalIF":6.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683325","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":"SSI-MedRx: A fraud-resilient healthcare system based on blockchain and SSI","authors":"Meriem Guerar ,&nbsp;Mauro Migliardi ,&nbsp;Enrico Russo ,&nbsp;Djamel Khadraoui ,&nbsp;Alessio Merlo","doi":"10.1016/j.bcra.2024.100242","DOIUrl":"10.1016/j.bcra.2024.100242","url":null,"abstract":"<div><div>Today, healthcare fraud poses a significant issue, encompassing everything from falsified billing claims and phantom services to the excessive prescription of opioid medications and medical identity theft. These deceptive activities cause substantial financial losses, erode patient trust, compromise healthcare quality, and threaten patient safety. In this paper, we introduce SSI-MedRx, a healthcare system based on blockchain technology and Self-Sovereign Identity (SSI). It is designed to ensure cross-border interoperability, preserve patient privacy, and prevent challenging healthcare frauds, including medical identity theft, phantom billing, kickbacks, and opioid overprescribing. By design, our system empowers patients by granting them complete control over their personal and health data. This shift toward patient-centric data management can potentially reduce the risk of data breaches, enhance care coordination, and improve overall healthcare outcomes.</div></div>","PeriodicalId":53141,"journal":{"name":"Blockchain-Research and Applications","volume":"6 1","pages":"Article 100242"},"PeriodicalIF":6.9,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143534969","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":"Adaptive control of bilateral teleoperation systems under denial-of-service attacks","authors":"Lanyan Wei,&nbsp;Yuling Li","doi":"10.1007/s43684-025-00093-1","DOIUrl":"10.1007/s43684-025-00093-1","url":null,"abstract":"<div><p>This paper investigates resilient consensus control for teleoperation systems under denial-of-service (DoS) attacks. We design resilient controllers with auxiliary systems based on sampled positions of both master and slave robots, enhancing robustness during DoS attacks. Additionally, we establish stability conditions on DoS attack duration and frequency by applying multivariate small-gain methods to ensure closed-loop stability without the need to solve linear matrix inequalities. Finally, the effectiveness of the controllers is validated through the simulation results, demonstrating that the master-slave synchronization is achieved.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-025-00093-1.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143489608","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":"Efficient and accurate road crack detection technology based on YOLOv8-ES","authors":"Kaili Zeng,&nbsp;Rui Fan,&nbsp;Xiaoyu Tang","doi":"10.1007/s43684-025-00091-3","DOIUrl":"10.1007/s43684-025-00091-3","url":null,"abstract":"<div><p>Road damage detection is an important aspect of road maintenance. Traditional manual inspections are laborious and imprecise. With the rise of deep learning technology, pavement detection methods employing deep neural networks give an efficient and accurate solution. However, due to background diversity, limited resolution, and fracture similarity, it is tough to detect road cracks with high accuracy. In this study, we offer a unique, efficient and accurate road crack damage detection, namely YOLOv8-ES. We present a novel dynamic convolutional layer(EDCM) that successfully increases the feature extraction capabilities for small fractures. At the same time, we also present a new attention mechanism (SGAM). It can effectively retain crucial information and increase the network feature extraction capacity. The Wise-IoU technique contains a dynamic, non-monotonic focusing mechanism designed to return to the goal-bounding box more precisely, especially for low-quality samples. We validate our method on both RDD2022 and VOC2007 datasets. The experimental results suggest that YOLOv8-ES performs well. This unique approach provides great support for the development of intelligent road maintenance systems and is projected to achieve further advances in future applications.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2025-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-025-00091-3.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143373272","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":"A cooperative jamming decision-making method based on multi-agent reinforcement learning","authors":"Bingchen Cai,&nbsp;Haoran Li,&nbsp;Naimin Zhang,&nbsp;Mingyu Cao,&nbsp;Han Yu","doi":"10.1007/s43684-025-00090-4","DOIUrl":"10.1007/s43684-025-00090-4","url":null,"abstract":"<div><p>Electromagnetic jamming is a critical countermeasure in defense interception scenarios. This paper addresses the complex electromagnetic game involving multiple active jammers and radar systems by proposing a multi-agent reinforcement learning-based cooperative jamming decision-making method (MA-CJD). The proposed approach achieves high-quality and efficient target allocation, jamming mode selection, and power control. Mathematical models for radar systems and active jamming are developed to represent a multi-jammer and multi-radar electromagnetic confrontation scenario. The cooperative jamming decision-making process is then modeled as a Markov game, where the QMix multi-agent reinforcement learning algorithm is innovatively applied to handle inter-jammer cooperation. To tackle the challenges of a parameterized action space, the MP-DQN network structure is adopted, forming the basis of the MA-CJD algorithm. Simulation experiments validate the effectiveness of the proposed MA-CJD algorithm. Results show that MA-CJD significantly reduces the time defense units are detected while minimizing jamming resource consumption. Compared with existing algorithms, MA-CJD achieves better solutions, demonstrating its superiority in cooperative jamming scenarios.</p></div>","PeriodicalId":71187,"journal":{"name":"自主智能系统(英文)","volume":"5 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2025-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43684-025-00090-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184710","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":"Chasing in virtual environment:Dynamic alignment for multi-user collaborative redirected walking","authors":"Tianyang Dong,&nbsp;Shuqian Lv,&nbsp;Hubin Kong,&nbsp;Huanbo Zhang","doi":"10.1016/j.vrih.2024.07.002","DOIUrl":"10.1016/j.vrih.2024.07.002","url":null,"abstract":"<div><h3>Background</h3><div>The redirected walking (RDW) method for multi-user collaboration requires maintaining the relative position between users in a virtual environment (VE) and physical environment (PE). A chasing game in a VE is a typical virtual reality game that entails multi-user collaboration. When a user approaches and interacts with a target user in the VE, the user is expected to approach and interact with the target user in the corresponding PE as well. Existing methods of multi-user RDW mainly focus on obstacle avoidance, which does not account for the relative positional relationship between the users in both VE and PE.</div></div><div><h3>Methods</h3><div>To enhance the user experience and facilitate potential interaction, this paper presents a novel dynamic alignment algorithm for multi-user collaborative redirected walking (DA-RDW) in a shared PE where the target user and other users are moving. This algorithm adopts improved artificial potential fields, where the repulsive force is a function of the relative position and velocity of the user with respect to dynamic obstacles. For the best alignment, this algorithm sets the alignment-guidance force in several cases and then converts it into a constrained optimization problem to obtain the optimal direction. Moreover, this algorithm introduces a potential interaction object selection strategy for a dynamically uncertain environment to speed up the subsequent alignment. To balance obstacle avoidance and alignment, this algorithm uses the dynamic weightings of the virtual and physical distances between users and the target to determine the resultant force vector.</div></div><div><h3>Results</h3><div>The efficacy of the proposed method was evaluated using a series of simulations and live-user experiments. The experimental results demonstrate that our novel dynamic alignment method for multi-user collaborative redirected walking can reduce the distance error in both VE and PE to improve alignment with fewer collisions.</div></div>","PeriodicalId":33538,"journal":{"name":"Virtual Reality Intelligent Hardware","volume":"7 1","pages":"Pages 26-46"},"PeriodicalIF":0.0,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143562755","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}