For the point cloud registration task, a significant challenge arises from
non-overlapping points that consume extensive computational resources while
negatively affecting registration accuracy. In this paper, we introduce a
dynamic approach, widely utilized to improve network efficiency in computer
vision tasks, to the point cloud registration task. We employ an iterative
registration process on point cloud data multiple times to identify regions
where matching points cluster, ultimately enabling us to remove noisy points.
Specifically, we begin with deep global sampling to perform coarse global
registration. Subsequently, we employ the proposed refined node proposal module
to further narrow down the registration region and perform local registration.
Furthermore, we utilize a spatial consistency-based classifier to evaluate the
results of each registration stage. The model terminates once it reaches
sufficient confidence, avoiding unnecessary computations. Extended experiments
demonstrate that our model significantly reduces time consumption compared to
other methods with similar results, achieving a speed improvement of over 41%
on indoor dataset (3DMatch) and 33% on outdoor datasets (KITTI) while
maintaining competitive registration recall requirements.

该论文介绍了一种动态方法，通过多次迭代点云数据的注册过程，识别匹配点聚类区域，从而删除噪点，并通过评估每个注册阶段的结果以提高网络效率。实验证明，该模型相较于其他方法在相似结果上显著减少时间消耗，室内数据集 (3DMatch) 速度提升超过 41%，室外数据集 (KITTI) 速度提升 33%，同时保持竞争性的注册召回需求。

高效点云配准的动态网络

A Dynamic Network for Efficient Point Cloud Registration

Blockchain systems are challenged by the so-called Trilemma tradeoff:
decentralization, scalability and security. Infrastructure and node
configuration, choice of the Consensus Protocol and complexity of the
application transactions are cited amongst the factors that affect the
tradeoffs balance. Given that Blockchains are complex, dynamic dynamic systems,
a dynamic approach to their management and reconfiguration at runtime is deemed
necessary to reflect the changes in the state of the infrastructure and
application. This paper introduces the utilisation of Digital Twins for this
purpose. The novel contribution of the paper is design of a framework and
conceptual architecture of a Digital Twin that can assist in maintaining the
Trilemma tradeoffs of time critical systems. The proposed Digital Twin is
illustrated via an innovative approach to dynamic selection of Consensus
Protocols. Simulations results show that the proposed framework can effectively
support the dynamic adaptation and management of the Blockchain

该论文介绍了利用数字孪生技术来帮助区块链系统的动态管理和重组，通过动态选择共识协议等方式维护区块链系统的性能平衡，模拟结果表明该数字孪生架构能够有效支持区块链的动态适应和管理。

区块链系统的动态管理数字孪生

Digital Twins for Dynamic Management of Blockchain Systems

The first-price auction is popular in practice for its simplicity and
transparency. Moreover, its potential virtues grow in complex settings where
incentive compatible auctions may generate little or no revenue. Unfortunately,
the first-price auction is poorly understood in theory because equilibrium is
not {\em a priori} a credible predictor of bidder behavior.
We take a dynamic approach to studying first-price auctions: rather than
basing performance guarantees solely on static equilibria, we study the
repeated setting and show that robust performance guarantees may be derived
from simple axioms of bidder behavior. For example, as long as a loser raises
her bid quickly, a standard first-price auction will generate at least as much
revenue as a second-price auction. We generalize this dynamic technique to
complex pay-your-bid auction settings and show that progressively stronger
assumptions about bidder behavior imply progressively stronger guarantees about
the auction's performance.
Along the way, we find that the auctioneer's choice of bidding language is
critical when generalizing beyond the single-item setting, and we propose a
specific construction called the {\em utility-target auction} that performs
well. The utility-target auction includes a bidder's final utility as an
additional parameter, identifying the single dimension along which she wishes
to compete. This auction is closely related to profit-target bidding in
first-price and ascending proxy package auctions and gives strong revenue
guarantees for a variety of complex auction environments. Of particular
interest, the guaranteed existence of a pure-strategy equilibrium in the
utility-target auction shows how Overture might have eliminated the cyclic
behavior in their generalized first-price sponsored search auction if bidders
could have placed more sophisticated bids.

本文以动态方法代替静态均衡，研究了英国拍卖和其他拍卖形式，其中提出了 Utility-Target auction，并得出了许多动态执行过程的结论。