The High-energy Fragment Separator(HFRS),which is currently under construction,is a leading international radioactive beam *** sets of position-sensitive twin time projection chamber(TPC)detectors are distributed on H...
详细信息
The High-energy Fragment Separator(HFRS),which is currently under construction,is a leading international radioactive beam *** sets of position-sensitive twin time projection chamber(TPC)detectors are distributed on HFRS for particle identification and beam *** twin TPCs'readout electronics system operates in a trigger-less mode due to its high counting rate,leading to a challenge of handling large amounts of *** address this problem,we introduced an event-building *** algorithm employs a hierarchicalprocessing strategy to compress data during transmission and *** addition,it reconstructs twin TPCs'events online and stores only the reconstructed particle information,which significantly reduces the burden on data transmission and storage *** studies demonstrated that the algorithm accurately matches twin TPCs'events and reduces more than 98%of the data volume at a counting rate of 500 kHz/channel.
Point cloud segmentation is one of the most important tasks in LiDAR remote sensing with widespread scientific, industrial, and commercial applications. The research thereof has resulted in many breakthroughs in 3D ob...
详细信息
Point cloud segmentation is one of the most important tasks in LiDAR remote sensing with widespread scientific, industrial, and commercial applications. The research thereof has resulted in many breakthroughs in 3D object and scene understanding. Existing methods typically utilize hierarchical architectures for feature representation. However, the commonly used sampling and grouping methods in hierarchical networks are not only time-consuming but also limited to point -wise 3D coordinates, ignoring the local semantic homogeneity of point clusters. To address these issues, we propose a novel 3D point cloud representation network, called Dynamic Clustering Transformer Network (DCTNet). It has an encoder-decoder architecture, allowing for both local and global feature learning. Specifically, the encoder consists of a series of dynamic clusteringbased Local Feature Aggregating (LFA) blocks and Transformer -based Global Feature Learning (GFL) blocks. In the LFA block, we propose novel semantic feature -based dynamic sampling and clustering methods, which enable the model to be aware of local semantic homogeneity for local feature aggregation. Furthermore, instead of traditional interpolation approaches, we propose a new semantic feature -guided upsampling method in the decoder for dense prediction. To our knowledge, DCTNet is the first work to introduce semantic information -based dynamic clustering into 3D Transformers. Extensive experiments on an object -based dataset (ShapeNet), and an airborne multispectral LiDAR dataset demonstrate the State -of -the -Art (SOTA) segmentation performance of DCTNet in terms of both accuracy and efficiency. Our code will be made publicly available.
Logical key free is an important issue for multicast key management. The degree of a tree and the algorithm which maintains the balance has great effect on the multicast key management. The paper makes an analysis on ...
详细信息
ISBN:
(纸本)9781424441983
Logical key free is an important issue for multicast key management. The degree of a tree and the algorithm which maintains the balance has great effect on the multicast key management. The paper makes an analysis on the key free degree with using hierarchical data processing model. The complete quad tree is taken as the logical structure of the key management, and the rebuilding algorithm of a complete logical key tree is based on the idea of subtree movement so that the external cost which caused by the tree balancing can be reduced. This paper gives the designing idea, analyzes and devises the realization algorithms, and constructs a practical complete free key management scheme. The analysis shows that this scheme is simple to realize and the cost is still low, being applicable to the situation where the group size is enormous and the changing of the group is frequent.
Logical key tree is an important issue for multicast key management. The degree of a tree and the algorithm which maintains the balance has great effect on the multicast key management. The paper makes an analysis on ...
详细信息
Logical key tree is an important issue for multicast key management. The degree of a tree and the algorithm which maintains the balance has great effect on the multicast key management. The paper makes an analysis on the key tree degree with using hierarchical data processing model. The complete quad tree is taken as the logical structure of the key management, and the rebuilding algorithm of a complete logical key tree is based on the idea of subtree movement so that the external cost which caused by the tree balancing can be reduced. This paper gives the designing idea, analyzes and devises the realization algorithms, and constructs a practical complete tree key management scheme. The analysis shows that this scheme is simple to realize and the cost is still low, being applicable to the situation where the group size is enormous and the changing of the group is frequent.
How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical k...
详细信息
How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical key tree and supply two important metrics to this problem： re-keying cost and key storage cost. The paper gives the basic theory to the hierarchical data processing and the analyzing model to multieast key management based on logical key tree. It has been proved that the 4-ray tree has the best performance in using these metrics. The key management problem is also investigated based on user probability model, and gives two evaluating parameters to re-keying and key storage cost.
暂无评论