查看更多>>摘要：Estimating rigid transformation using noisy correspondences is critical to feature-based point cloud registration.Recently,a series of studies have attempted to combine traditional robust model fitting with deep learning.Among them,DHVR proposed a hough voting-based method,achieving new state-of-the-art performance.However,we find voting on rotation and translation simultaneously hinders achieving better performance.Therefore,we proposed a new hough voting-based method,which decouples rotation and translation space.Specifically,we first utilize hough voting and a neural network to estimate rotation.Then based on good initialization on rotation,we can easily obtain accurate rigid transformation.Extensive experiments on 3DMatch and 3DLoMatch datasets show that our method achieves comparable performances over the state-of-the-art methods.We further demonstrate the generalization of our method by experimenting on KITTI dataset.
查看更多>>摘要：The sixth-generation(6G)wireless communication system is envisioned be cable of providing highly dependable services by integrating with native reliable and trustworthy functionalities.Zero-trust vehicular networks is one of the typical scenarios for 6G dependable services.Under the technical framework of vehicle-and-roadside collaboration,more and more on-board devices and roadside infrastructures will communicate for information exchange.The reliability and security of the vehicle-and-roadside collaboration will directly affect the transportation safety.Considering a zero-trust vehicular environment,to prevent malicious vehicles from uploading false or invalid information,we propose a malicious vehicle identity disclosure approach based on the Shamir secret sharing scheme.Meanwhile,a two-layer consortium blockchain architecture and smart contracts are designed to protect the identity and privacy of benign vehicles as well as the security of their private data.After that,in order to improve the efficiency of vehicle identity disclosure,we present an inspection policy based on zero-sum game theory and a roadside unit incentive mechanism jointly using contract theory and subjective logic model.We verify the performance of the entire zero-trust solution through extensive simulation experiments.On the premise of protecting the vehicle privacy,our solution is demonstrated to significantly improve the reliability and security of 6G vehicular networks.
查看更多>>摘要：In this work,we propose a stateless blockchain called CompactChain,which compacts the entire state of the UTXO(Unspent Transaction Output)based blockchain systems into two RSA accumulators.The first accumulator is called Transaction Output(TXO)commitment which represents the TXO set.The second one is called Spent Transaction Output(STXO)commitment which represents the STXO set.In this work,we discuss three algorithms:(i)To update the TXO and STXO commitments by the miner.The miner also provides the proofs for the correctness of the updated commitments;(ii)To prove the transaction's validity by providing a membership witness in TXO commitment and non-membership witness against STXO commitment for a coin being spent by a user;(iii)To update the witness for the coin that is not yet spent;The experimental results evaluate the performance of the CompactChain in terms of time taken by a miner to update the commitments and time taken by a validator to verify the commitments and validate the transactions.We compare the performance of CompactChain with the existing state-of-the-art works on stateless blockchains.CompactChain shows a reduction in commitments update complexity and transaction witness size which inturn reduces the mempool size and propagation latency without compromising the system throughput(Transactions per second(TPS)).
查看更多>>摘要：After the Ethereum DAO attack in 2016,which resulted in significant economic losses,blockchain governance has become a prominent research area.However,there is a lack of comprehensive and systematic literature review on blockchain governance.To deeply understand the process of blockchain governance and provide guidance for the future design of the blockchain governance model,we provide an in-depth review of blockchain governance.In this paper,first we introduce the consensus algorithms currently used in blockchain and relate them to governance theory.Second,we present the main content of off-chain governance and investigate two well-known off-chain governance projects.Third,we investigate four common on-chain governance voting techniques,then summarize the seven attributes that the on-chain governance voting process should meet,and finally analyze four well-known on-chain governance blockchain projects based on the previous research.We hope this survey will provide an in-depth insight into the potential development direction of blockchain governance and device future research agenda.
查看更多>>摘要：With the emergence of network-centric data,social network graph publishing is conducive to data analysts to mine the value of social networks,analyze the social behavior of individuals or groups,implement personalized recommenda-tions,and so on.However,published social network graphs are often subject to re-identification attacks from adversaries,which results in the leakage of users'privacy.The k-anonymity technology is widely used in the field of graph publishing,which is quite effective to resist re-identification attacks.However,the current researches still exist some issues to be solved:the protection of directed graphs is less concerned than that of undirected graphs;the protection of graph structure is often ignored while achieving the protection of nodes'identities;the same protection is performed for different users,which doesn't meet the different privacy requirements of users.Therefore,to address the above issues,a multi-level k-degree anonymity(MLDA)scheme on directed social network graphs is proposed in this paper.First,node sets with different importance are divided by the firefly algorithm and constrained connectedness upper approximation,and they are performed different k-degree anonymity protection to meet the different privacy requirements of users.Second,a new graph anonymity method is proposed,which achieves the addition and removal of edges with the help of fake nodes.In addition,to improve the utility of the anonymized graph,a new edge cost criterion is proposed,which is used to select the most appropriate edge to be removed.Third,to protect the community structure of the original graph as much as possible,fake nodes contained in a same community are merged prior to fake nodes contained in different communities.Experimental results on real datasets show that the newly proposed MLDA scheme is effective to balance the privacy and utility of the anonymized graph.
查看更多>>摘要：Numerous studies have demonstrated that human microRNAs(miRNAs)and diseases are associated and studies on the microRNA-disease association(MDA)have been conducted.We developed a model using a low-rank approximation-based link propagation algorithm with Hilbert-Schmidt independence criterion-based multiple kernel learning(HSIC-MKL)to solve the problem of the large time commitment and cost of traditional biological experiments involving miRNAs and diseases,and improve the model effect.We constructed three kernels in miRNA and disease space and conducted kernel fusion using HSIC-MKL.Link propagation uses matrix factorization and matrix approximation to effectively reduce computation and time costs.The results of the experiment show that the approach we proposed has a good effect,and,in some respects,exceeds what existing models can do.
NETL
NSTL
万方数据