检索结果-内蒙古大学图书馆

Exact and inexact search for 2d side-sharing tandems

THEORETICAL COMPUTER SCIENCE 2025年 1026卷

作者： Marcus, Shoshana Sokol, Dina Zelikovitz, Sarah CUNY Kingsborough Community Coll Dept Math & Comp Sci Brooklyn NY 11201 USA CUNY Brooklyn Coll Dept Comp & Informat Sci Brooklyn NY USA CUNY Grad Ctr Brooklyn NY USA CUNY Coll Staten Isl Dept Comp Sci Staten Isl NY USA

A side-sharing tandem is a rectangular array that is composed of two adjacent non-overlapping occurrences of the same rectangular block. Furthering our understanding of side-sharing tandems can facilitate the development of more efficient 2d pattern matching techniques and may lead to improvements in multi-dimensional compression schemes. Existing algorithms for finding side-sharing tandems are far from optimal on 2d arrays that contain relatively few side-sharing tandems. In this paper, we introduce the idea of a run of side-sharing tandems, as a maximally extended chain of 2d tandems. We demonstrate tight upper bounds on the number of runs of side-sharing tandems that can occur in a rectangular array. We develop an algorithm that locates all i runs of side-sharing tandems in an n x n input array in O((n2 + i) log n/ log log n) time. We also introduce several versions of approximate side-sharing tandems with k mismatches along with efficient algorithms for locating them in a rectangular array.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Enhanced IoT Sensor Data Management for Engineering Monitoring

引用

IEEE SENSORS JOURNAL 2025年第4期25卷 7363-7375页

作者： Wang, Qian Wang, Zhuo China Mobile Grp Design Inst Co Ltd Hubei Branch Wuhan 430024 Peoples R China China Railway 11 Bur Grp Corp Ltd Survey & Design Inst Wuhan 430000 Peoples R China

In engineering monitoring and the Internet of Things (IoT) sensor networks, ensuring data security and real-time performance is a critical challenge. Traditional centralized data management faces issues such as high risks of data tampering, insufficient privacy protection, and inconsistent data sharing among multiple parties, making it difficult to handle high-frequency updates and complex collaboration. To address these issues, this article proposes a blockchain-based improved consensus algorithm, Reputation-based Practical Byzantine Fault Tolerance (RPBFT), to enhance the management efficiency and security of IoT sensor data. RPBFT enables secure data storage and sharing through smart contracts and introduces a node behavior incentive mechanism and a simplified consensus protocol to reduce communication overhead and consensus latency. Experimental results show that RPBFT reduces consensus latency by approximately 30%, increases throughput by 70%, significantly reduces energy consumption, and exhibits strong resistance to attacks. The study demonstrates that RPBFT is suitable for resource-constrained IoT sensor networks and can enhance performance and security in larger-scale and more complex network environments. Furthermore, the proposed algorithm provides practical implications for improving data reliability and system efficiency in real-world engineering monitoring scenarios, such as structural health monitoring and environmental safety supervision.

关键词： Monitoring Blockchains Sensors Internet of Things Data centers Smart contracts Intelligent sensors Memory Security Indexes Blockchain consensus algorithm data security engineering monitoring Internet of Things (IoT) sensor networks Reputation-based Practical Byzantine Fault Tolerance (RPBFT)

来源：评论

学校读者我要写书评

暂无评论

Prophet upper bounds for online matching and auctions

引用

OPERATIONS RESEARCH LETTERS 2025年 61卷

作者： Soto, Jose A. Verdugo, Victor Univ Chile Dept Math Engn Santiago Chile Univ Chile IRL CNRS 2807 Ctr Math Modeling Santiago Chile Pontificia Univ Catolica Chile Inst Math & Computat Engn Santiago Chile Pontificia Univ Catolica Chile Dept Ind & Syst Engn Santiago Chile

In the online 2-bounded auction problem, we have a collection of items represented as nodes in a graph and bundles of size two represented by edges. Agents are presented sequentially, each with a random weight function over the bundles. The goal of the decision-maker is to find an allocation of bundles to agents of maximum weight so that every item is assigned at most once, i.e., the solution is a matching in the graph. When the agents are single-minded (i.e., put all the weight in a single bundle), we recover the maximum weight prophet matching problem under edge arrivals (a.k.a. prophet matching). In this work, we provide new and improved upper bounds on the competitiveness achievable by an algorithm for the general online 2-bounded auction and the (single-minded) prophet matching problems. For the adversarial arrival order of the agents, we show that no algorithm for the online 2-bounded auction problem achieves a competitiveness larger than 4/11, while no algorithm for prophet matching achieves a competitiveness larger than approximate to 0.4189. Using a continuous-time analysis, we also improve the known bounds for online 2-bounded auctions for random order arrivals to approximate to 0.5968 in the general case, a bound of approximate to 0.6867 in the IID model, and approximate to 0.6714 in prophet-secretary model.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed Average consensus in Wireless Multi-Agent Systems with Over-the-Air Aggregation 25

Distributed Average Consensus in Wireless Multi-Agent System...

引用

25th IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Charalambous, Themistoklis Chen, Zheng Hadjicostis, Christoforos N. Univ Cyprus Dept Elect & Comp Engn Nicosia Cyprus Linkoping Univ Dept Elect Engn Linkoping Sweden

ISBN: (纸本)9798350393194;9798350393187

In this paper, we address the average consensus problem of multi-agent systems over wireless networks. We propose a distributed average consensus algorithm by invoking the concept of over-the-air aggregation, which exploits the signal superposition property of wireless multiple-access channels. The proposed algorithm deploys a modified version of the well-known Ratio consensus algorithm with an additional normalization step for compensating for the arbitrary channel coefficients. We show that, when the noise level at the receivers is negligible, the algorithm converges asymptotically to the average for time-invariant and time-varying channels. Numerical simulations corroborate the validity of our results.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Trajectory consensus for Coordination of Multiple Curvature-Bounded Vehicles

引用

IEEE TRANSACTIONS ON CYBERNETICS 2022年第7期52卷 6307-6319页

作者： Yao, Weiran Xin, Liming Peng, Yan Chen, Yang Qi, Naiming Sun, Yu Harbin Inst Technol Sch Astronaut Harbin 150001 Peoples R China Shanghai Univ Sch Comp Engn & Sci Shanghai 200444 Peoples R China Univ Toronto Dept Mech & Ind Engn Toronto ON M5S 3G8 Canada Shanghai Univ Sch Mechatron Engn & Automat Shanghai 200444 Peoples R China Harbin Engn Univ Coll Intelligent Syst Sci & Engn Harbin 150001 Peoples R China Univ Toronto Dept Elect & Comp Engn Toronto ON M5S 3G8 Canada

This article addresses the trajectory consensus problem of coordinating the trajectories of vehicles at multiple future time points. The objective is the consensus of the geometry of the vehicles' planned trajectories. The geometric feature of trajectories is parameterized by a set of trajectory states defined as required lengths along the trajectory to reduce the distance to its ending point to specific values. To solve this special consensus problem involving coupled state variables, the conventional consensus model is extended by attaching it to a mapping from the state variables to the trajectory's geometry. This mapping is established using a homotopic structure that creates a compact and efficient form for the mapping. The geometry of the homotopic structure is based on the shapes of its envelopes, and the elements in the structure are derived from their deformation. Through a homotopic search in the structure, an asymptotic consensus of trajectory states is achieved. Simulation results show the proposed coupled state consensus method can achieve better performance on the consensus of multiple vehicles than the conventional isolated state consensus method.

关键词： Trajectory Geometry Shape consensus algorithm Planning Trajectory tracking Trajectory planning Curvature-bounded trajectory homotopic method multiple vehicle coordination state consensus

来源：评论

学校读者我要写书评

暂无评论

Proof of Sense: A Novel consensus Mechanism for Spectrum Misuse Detection

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2022年第12期18卷 9206-9216页

作者： Fernando, Pramitha Dadallage, Keshawa Gamage, Tharindu Seneviratne, Chathura Madanayake, Arjuna Liyanage, Madhusanka Vrije Univ Brussel Fac Engn B-1050 Brussels Belgium Univ Ruhuna Dept Elect & Informat Engn Galle 80000 Sri Lanka Florida Int Univ FIU Dept Elect & Comp Engn Miami FL 33199 USA Univ Coll Dublin Sch Comp Sci Dublin DO4 V1W8 4 Ireland Univ Oulu Ctr Wireless Commun Oulu 90570 Finland

Optimal use of scarce radio spectrum is essential in the proliferation of beyond 5G networks, and promising blockchain technology offers various benefits for the spectrum management. However, existing blockchain-based solutions are expensive, nonoptimized, and lack spectrum fraud detection. This article proposes a novel consensus mechanism for a blockchain-based dynamic spectrum access (DSA) system. The proposed "Proof-of-Sense" consensus mechanism operates based on spectrum sensing procedures rather than cryptographic calculations. It is specially designed to address fraudulent/unauthorized access to the spectrum by analyzing the sensed spectrum data. The core of the consensus mechanism is a cryptographic key sharing mechanism inspired by Shamir's secret sharing scheme. Moreover, the proposed DSA system can enable different microservices, such as automated spectrum auctions, payment and penalty handling, and spectrum fraud detection. A proof of concept based on experimental approaches coupled with Matlab simulations is presented to analyze the performance of the proposed consensus mechanism.

关键词： Blockchains Sensors Regulators Stakeholders Informatics Wireless sensor networks Radio spectrum management Blockchain consensus algorithm dynamic spectrum access (DSA) spectrum management spectrum misuse spectrum sensing smart contracts (SC)

来源：评论

学校读者我要写书评

暂无评论

A Proof-of-Transactions Blockchain consensus Protocol for Large-Scale IoT

引用

IEEE INTERNET OF THINGS JOURNAL 2022年第11期9卷 7931-7943页

作者： Ai, Zhendong Cui, Wei South China Univ Technol Sch Automat Sci & Engn Guangzhou 510641 Peoples R China

Blockchain technology can benefit Internet of Things (IoT) in terms of message exchange, access control, and management;however, existing blockchain consensus protocols cannot provide sufficient performance without compromising security and fairness. This article proposes a round-based two-stage blockchain consensus protocol called Proof-of-Transactions (PoT) for a variety of requirements, such as performance and security of large-scale IoT. In the first stage of each round, all nodes preconstruct new blocks and exchange information about the number of valid transactions contained in each other's blocks. The block containing most valid transactions is broadcasted in the second stage and examined by all nodes of the cluster before being received as the new block in the global blockchain ledger. The consensus reaching of a new block requires only two rounds of message exchange process. Theoretical analysis and experimental results verify the feasibility and superiority of the proposed protocol.

关键词： Peer-to-peer computing Internet of Things consensus protocol consensus algorithm Throughput Synchronization Indexes Blockchain consensus Internet of Things (IoT)

来源：评论

学校读者我要写书评

暂无评论

Resilient Delayed Impulsive Control for consensus of Multiagent Networks Subject to Malicious Agents

引用

IEEE TRANSACTIONS ON CYBERNETICS 2022年第7期52卷 7196-7205页

作者： Zhai, Yang Liu, Zhi-Wei Guan, Zhi-Hong Gao, Zhiwei Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Minist Educ Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China Northumbria Univ Fac Engn & Environm Newcastle Upon Tyne NE1 8ST Tyne & Wear England

Impulsive control is widely applied to achieve the consensus of multiagent networks (MANs). It is noticed that malicious agents may have adverse effects on the global behaviors, which, however, are not taken into account in the literature. In this study, a novel delayed impulsive control strategy based on sampled data is proposed to achieve the resilient consensus of MANs subject to malicious agents. It is worth pointing out that the proposed control strategy does not require any information on the number of malicious agents, which is usually required in the existing works on resilient consensus. Under appropriate control gains and sampling period, a necessary and sufficient graphic condition is derived to achieve the resilient consensus of the considered MAN. Finally, the effectiveness of the resilient delayed impulsive control is well demonstrated via simulation studies.

关键词： Delays consensus algorithm Topology Graphics Upper bound Safety Linear matrix inequalities Communication delays impulsive control multiagent network (MAN) resilient consensus trusted agent

来源：评论

学校读者我要写书评

暂无评论

Securing Blockchain-Based IoT Systems: A Review

引用

IEEE ACCESS 2024年 12卷 98856-98881页

作者： Commey, Daniel Mai, Bin Hounsinou, Sena G. Crosby, Garth V. Texas A&M Univ Multidisciplinary Engn Dept College Stn TX 77843 USA Texas A&M Univ Engn Technol & Ind Distribut Dept College Stn TX 77843 USA Metro State Univ Dept Comp Sci & Cybersecur St Paul MN 55106 USA

This paper reviews the role of blockchain technology in enhancing the security of Internet of Things (IoT) systems and maintaining data integrity. We address the increased vulnerabilities and broader attack surface resulting from the integration of blockchain and IoT. The review emphasizes the potential of technologies like zero-knowledge proofs (ZKP) and post-quantum cryptography (PQC) to mitigate these security challenges. Additionally, we explore how game theory, machine learning, and cyber deception strengthen the defense of blockchain-based IoT systems against various threats. The paper also identifies open research areas, emphasizing the need for continued exploration to advance these fields. An additional contribution of this study is introducing a conceptual framework incorporating these technologies, laying the groundwork for developing advanced security solutions within the blockchain-enhanced IoT ecosystem.

关键词： Blockchains Security Peer-to-peer computing Reviews Optimization consensus algorithm Quantum cryptography Blockchain blockchain-IoT (BIoT) systems cyber deception Internet of Things (IoT) IoT security security optimization zero-knowledge proofs (ZKP) post-quantum cryptography (PQC) machine learning game theory zero-knowledge proofs (ZKP) post-quantum cryptography (PQC) machine learning game theory

来源：评论

学校读者我要写书评

暂无评论

A novel blockchain-based digital forensics framework for preserving evidence and enabling investigation in industrial Internet of Things

引用

ALEXANDRIA ENGINEERING JOURNAL 2024年 86卷 631-643页

作者： Xiao, Nan Wang, Zhaoshun Sun, Xiaoxue Miao, Junfeng Univ Sci & Technol Beijing Beijing Peoples R China

To address challenges in digital evidence collection and responsibility determination for industrial safety accidents involving industrial Internet of Things (IIoT) device nodes, this paper proposes a blockchain-based digital forensic scheme within the IIoT communication architecture. The scheme utilizes a decentralized blockchain storage mechanism to enable remote storage of digital forensic data. Additionally, it leverages smart contract mechanisms to facilitate efficient retrieval and tracing of related evidence chains. To enhance data security of IIoT device nodes, a token mechanism is implemented for access control. Moreover, to meet real-time evidence acquisition requirements in IIoT, an efficient batch consensus mechanism is proposed. Experimental simulations demonstrate the superiority of the novel consensus algorithm compared to the traditional Delegated Proof-of-Stake (DPOS) consensus in the proposed scheme for the IIoT environment. It meets speed requirements for evidence collection, ensuring tamper-proof, non-repudiable, and permanent storage of digital forensic data. Consequently, the application of blockchain technology for judicial access and evidence storage has made significant contributions to digital forensics within the IIoT context.

关键词： IIoT Blockchain Digital forensic Electronic evidence consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：