Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to so...Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.展开更多
This paper uses two navigation schemes to prove the potential of a novel autonomous orbit determination with stellar horizon atmospheric refraction measurements. Scheme one needs a single processor and uses an extende...This paper uses two navigation schemes to prove the potential of a novel autonomous orbit determination with stellar horizon atmospheric refraction measurements. Scheme one needs a single processor and uses an extended Kalman filter. The second scheme needs two parallel processors. One processor uses a hatched leastsquare initial state estimator and a high-precision dynamic state propagator. The other processor uses a real-time orbit predictor. Simulations have been executed respectively for three types （low/medial/high） of satellite orbits on which various numbers of stars are observed. The results show both schemes can autonomously determine the orbits with a considerable performance. The second scheme in general performs a little better than the first scheme.展开更多
PROFESSOR Yuan Jingfang has many titles: Dean of the Music Department, Central Conservatory of Music; Tutor of Doctors; Vice-president of China’s Traditional Music Society; Member of the National Music Committee of C...PROFESSOR Yuan Jingfang has many titles: Dean of the Music Department, Central Conservatory of Music; Tutor of Doctors; Vice-president of China’s Traditional Music Society; Member of the National Music Committee of China’s Musicians Society; and Council Member of South China’s Music. Yuan truly carried on national music traditions and has persisted in disseminating them. Yuan is from Yueyang, Hunan Province. Her love of music was not influenced by her family, unlike other performers of national instrumental music. Yuan’s father is an engineer and her mother a nurse. Her desire to perform and study national music was fostered by the vigorous and grand scene she witnessed of performers beating waist drums to celebrate the founding of New China.展开更多
基金supported by Anhui Provincial Key R&D Program of China(202004a05020040),the open project of State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System in China(CEMEE2018Z0102B)the open fund of Intelligent Interconnected Systems Laboratory of Anhui Province(PA2021AKSK0114),Hefei University of Technology.
文摘Blockchain is a viable solution to provide data integrity for the enormous volume of 5G IoT social data, while we need to break through the throughput bottleneck of blockchain. Sharding is a promising technology to solve the problem of low throughput in blockchains. However, cross-shard communication hinders the effective improvement of blockchain throughput. Therefore, it is critical to reasonably allocate transactions to different shards to improve blockchain throughput. Existing research on blockchain sharding mainly focuses on shards formation, configuration, and consensus, while ignoring the negative impact of cross-shard communication on blockchain throughput. Aiming to maximize the throughput of transaction processing, we study how to allocate blockchain transactions to shards in this paper. We propose an Associated Transaction assignment algorithm based on Closest Fit (ATCF). ATCF classifies associated transactions into transaction groups which are then assigned to different shards in the non-ascending order of transaction group sizes periodically. Within each epoch, ATCF tries to select a shard that can handle all the transactions for each transaction group. If there are multiple such shards, ATCF selects the shard with the remaining processing capacity closest to the number of transactions in the transaction group. When no such shard exists, ATCF chooses the shard with the largest remaining processing capacity for the transaction group. The transaction groups that cannot be completely processed within the current epoch will be allocated in the subsequent epochs. We prove that ATCF is a 2-approximation algorithm for the associated transaction assignment problem. Simulation results show that ATCF can effectively improve the blockchain throughput and reduce the number of cross-shard transactions.
文摘This paper uses two navigation schemes to prove the potential of a novel autonomous orbit determination with stellar horizon atmospheric refraction measurements. Scheme one needs a single processor and uses an extended Kalman filter. The second scheme needs two parallel processors. One processor uses a hatched leastsquare initial state estimator and a high-precision dynamic state propagator. The other processor uses a real-time orbit predictor. Simulations have been executed respectively for three types （low/medial/high） of satellite orbits on which various numbers of stars are observed. The results show both schemes can autonomously determine the orbits with a considerable performance. The second scheme in general performs a little better than the first scheme.
文摘PROFESSOR Yuan Jingfang has many titles: Dean of the Music Department, Central Conservatory of Music; Tutor of Doctors; Vice-president of China’s Traditional Music Society; Member of the National Music Committee of China’s Musicians Society; and Council Member of South China’s Music. Yuan truly carried on national music traditions and has persisted in disseminating them. Yuan is from Yueyang, Hunan Province. Her love of music was not influenced by her family, unlike other performers of national instrumental music. Yuan’s father is an engineer and her mother a nurse. Her desire to perform and study national music was fostered by the vigorous and grand scene she witnessed of performers beating waist drums to celebrate the founding of New China.
