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

Throughput-oriented associated transaction assignment in sharding blockchains for IoT social data storage

Digital Communications and Networks 2022年第6期8卷 885-899页

作者： Liping Tao Yang Lu Xu Ding Yuqi Fan Jung Yoon Kim School of Computer Science and Information Engineering Hefei University of TechnologyHefei230009China Engineering Research Center of Safety Critical Industrial Measurement and Control Technology Ministry of EducationHefei University of TechnologyHefei230009China Institute of Industry&Equipment Technology Hefei University of TechnologyHefei230009China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) Ministry of EducationHefei230009China Graduate School of Game Gachon UniversitySeongnam-Si461-701South Korea

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.

关键词： IoT social data Blockchain Shar ding Associated transactions Transaction assi gnment

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Object Detection Method for Bank Operation and Maintenance Scenarios 5

A Lightweight Object Detection Method for Bank Operation and...

引用

5th International Conference on Pattern Recognition and Artificial Intelligence, PRAI 2022

作者： Xue, Junmin Rao, Yunbo Wu, Jiangang Gou, Haosong Liu, Yong Yang, Yang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu China Data Center of Postal Savings Bank of China Beijing China Chengdu Aerospace Science and Industry Big Data Research Institute Corporation Limited Chengdu China Sichuan Institute of Computer Sciences Chengdu China

ISBN: (数字)9781665499163

ISBN: (纸本)9781665499163

Due to the complex background of bank operation and maintenance scenarios, it is extremely difficult to detect and analyze the object of operation and maintenance scenarios. The traditional target detection algorithms, such as F-RCNN, are not suitable for object detection. We propose a lightweight object detection method for bank operation and maintenance scenarios based on deep learning. The proposed method highlights two improvements based on Yolov5. The first adjustment of it is this method constructs a new convolution method and a new activation function. Also, we use the multi-scale output strategy of Feature Pyramid Networks (FPN) to develop a new lightweight feature extraction algorithm. These changes we made are based on the real-life situation, such as bank operation and maintenance scenarios. Experiments have been carried out on the same data set with multiple object detection algorithms, and the experimental results show that the proposed method reduces the complexity of the activation function. Meanwhile, the module is flexible, and can be easily applied to other similar business scenario detection models. © 2022 IEEE.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Play like a Vertex: A Stackelberg Game Approach for Streaming Graph Partitioning

arXiv

引用

arXiv 2024年

作者： Ding, Zezhong Xiang, Yongan Wang, Shangyou Xie, Xike Zhou, S. Kevin School of Data Science School of Computer Science and Technology School of Biomedical Engineering Data Darkness Lab MIRACLE Center Suzhou Institute for Advanced Research University of Science and Technology of China Jiangsu Suzhou China

In the realm of distributed systems tasked with managing and processing large-scale graph-structured data, optimizing graph partitioning stands as a pivotal challenge. The primary goal is to minimize communication overhead and runtime cost. However, alongside the computational complexity associated with optimal graph partitioning, a critical factor to consider is memory overhead. Real-world graphs often reach colossal sizes, making it impractical and economically unviable to load the entire graph into memory for partitioning. This is also a fundamental premise in distributed graph processing, where accommodating a graph with non-distributed systems is unattainable. Currently, existing streaming partitioning algorithms exhibit a skew-oblivious nature, yielding satisfactory partitioning results exclusively for specific graph types. In this paper, we propose a novel streaming partitioning algorithm, the Skewness-aware Vertex-cut Partitioner (S5P), designed to leverage the skewness characteristics of real graphs for achieving high-quality partitioning. S5P offers high partitioning quality by segregating the graph’s edge set into two subsets, head and tail sets. Following processing by a skewness-aware clustering algorithm, these two subsets subsequently undergo a Stackelberg graph game. Our extensive evaluations conducted on substantial real-world and synthetic graphs demonstrate that, in all instances, the partitioning quality of S5P surpasses that of existing streaming partitioning algorithms, operating within the same load balance constraints. For example, S5P can bring up to a 51% improvement in partitioning quality compared to the top partitioner among the baselines. Lastly, we showcase that the implementation of S5P results in up to an 81% reduction in communication cost and a 130% increase in runtime efficiency for distributed graph processing tasks on *** Codes 97P30 Copyright © 2024, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Routing over Best Links is not necessarily Better in Wireless Multi-hop Networks

Routing over Best Links is not necessarily Better in Wireles...

引用

International Workshop on Quality of Service

作者： Shutao Lu Wuyungerile Li Yintu Bao Alvin C. Valera Winston K.G. Seah Baoqi Huang Inner Mongolia Key Lab. of Wireless Networking & Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

ISBN: (数字)9798350350128

ISBN: (纸本)9798350350135

The conventional approach of choosing the best route to carry network traffic in wireless multi-hop networks does not maximize the overall network throughput and can lead to short-term instabilities in network state with dire consequences. To date, wireless network route selection considers mainly network or link metrics, always picking the best links, thus channeling all packets through a subset of all available links. This leaves weaker links under-utilized although such links can in fact be used to carry smaller packets or packets with less stringent requirements and free up bandwidth on the better links for larger packets or traffic with higher service requirements. As network traffic volume and heterogeneity increase in future networks, we need to maximize the usage of available network bandwidth and distribute the network traffic load. We combine network link metrics and packet attributes to determine the successful packet transmission probability, and then use this outcome to pick suitable links to forward the packet, which is not necessarily the link with the best metric. To validate the efficacy of our proposed approach in routing performance and energy efficiency, we applied it in routing for wireless multi-hop networks. More importantly, we are able to spread the traffic across nodes in the network, thus achieving better network load-balancing and higher network resource utilization.

关键词： Measurement Wireless networks Spread spectrum communication Telecommunication traffic Bandwidth Routing Throughput

来源：评论

学校读者我要写书评

暂无评论

Gradient Boosting-Accelerated Evolution for Multiple-Fault Diagnosis

Gradient Boosting-Accelerated Evolution for Multiple-Fault D...

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： Hongfei Wang Chenliang Luo Deqing Zou Hai Jin Wenjie Cai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Wuhan China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security School of Cyber Science and Engineering Wuhan China Huazhong University of Science and Technology Wuhan China Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China College of Public Administration Wuhan China

ISBN: (数字)9783981926385

ISBN: (纸本)9798350348606

Logic diagnosis is a key step in yield learning. Multiple faults diagnosis is challenging because of several reasons, including error masking, fault reinforcement, and huge search space for possible fault combinations. This work proposes a two-phase method for multiple-fault diagnosis. The first phase efficiently reduces the potential number of fault candidates through machine learning. The second phase obtains the final diagnosis results, by formulating the task as an combinational optimization problem that is later iteratively solved using binary evolution computation. Experiments shows that our method outperforms two existing methods for multiple-fault diagnosis, and achieves better diagnosability (improved by $1.87\times$ ) and resolution (improved by $1.42\times$ ) compared with a state-of-the-art commercial diagnosis tool.

关键词： Fault diagnosis Adaptation models Computational modeling Fitting Filtering algorithms Boosting Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A multi-source signals separation algorithm for identifying the threatening signals applied in Fiber-Optic Distributed Acoustic Sensor

A multi-source signals separation algorithm for identifying ...

引用

2023 Optical Fiber Communications Conference and Exhibition, OFC 2023

作者： He, Tao Zhang, Shixiong Li, Hao Yan, Zhijun Liu, Deming Sun, Qizhen School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Wuhan430074 China Optics Valley Laboratory Huazhong University of Science and Technology School of Optical and Electronic Information National Laboratory for Optoelectronics National Engineering Laboratory for Next Generation Internet Access System Wuhan430074 China

A multi-source signals separation algorithm is proposed to identify the potential threatening signals submerged in the strong background noises. Finally, the recognition rate of the mixed signals is improved from 62.8... 详细信息

ISBN: (纸本)9781957171180

关键词： Source separation

来源：评论

学校读者我要写书评

暂无评论

Anchor-Free RepPoints and Attention Mechanism Based Adaptive Siamese Network for Object Tracking

引用

Moshi Shibie yu Rengong Zhineng/Pattern Recognition and Artificial Intelligence 2024年第11期37卷 974-985页

作者： Yuan, Shuai Dou, Huize Geng, Jinyu Luan, Fangjun School of Computer Science and Engineering Shenyang Jianzhu University Shenyang110168 China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Jianzhu University Shenyang110168 China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang Jianzhu University Shenyang110168 China School of Electrical and Control Engineering Shenyang Jianzhu University Shenyang110168 China

The high computational complexity of current Siamese network based target tracking algorithm during the candidate box generation stage results in poor real-time performance and reduced accuracy in complex scenarios. To address these issues, an anchor-free RepPoints and attention mechanism based adaptive Siamese network for object tracking is proposed. First, a large-kernel convolutional attention module is introduced in the backbone network of the Siamese subnetwork to extract global features of the target, enhancing the precision and generalization ability of the model. Second, a module for anchor-free multi-RepPoints is utilized to learn multiple RepPoints of the target, and then an adaptive learning weight coefficient module is employed to filter out more accurate target RepPoints, further improving model precision and robustness. Finally, RepPoints are transformed into predicted boxes, thereby eliminating the need for predefined candidate boxes, reducing computational complexity and enhancing real-time tracking performance. Experiments indicate that the proposed method achieves significant improvements in precision and success rate on four datasets. © 2024 science Press. All rights reserved.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Movable Antenna Enabled Near-Field Communications: Channel Modeling and Performance Optimization

引用

IEEE Transactions on Communications 2025年

作者： Zhu, Lipeng Ma, Wenyan Xiao, Zhenyu Zhang, Rui National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore Beihang University School of Electronic and Information Engineering Beijing100191 China The Chinese University of Hong Kong School of Science and Engineering Shenzhen Research Institute of Big Data Shenzhen518172 China

Movable antenna (MA) technology offers promising potential to enhance wireless communication by allowing flexible antenna movement. To maximize spatial degrees of freedom (DoFs), larger movable regions are required, which may render the conventional far-field assumption for channels between transceivers invalid. In light of it, we investigate in this paper MA-enabled near-field communications, where a base station (BS) with multiple movable subarrays serves multiple users, each equipped with a fixed-position antenna (FPA). First, we extend the field response channel model for MA systems to the near-field propagation scenario. Next, we examine MA-aided multiuser communication systems under both digital and analog beamforming architectures. For digital beamforming, spatial division multiple access (SDMA) is utilized, where an upper bound on the minimum achievable rate across users is derived in closed form. A low-complexity algorithm based on zero-forcing (ZF) is then proposed to jointly optimize the antenna position vector (APV) and digital beamforming matrix (DBFM) to approach this bound. For analog beamforming, orthogonal frequency division multiple access (OFDMA) is employed, and an upper bound on the minimum achievable rate among users is also derived. An alternating optimization (AO) algorithm is proposed to iteratively optimize the APV, analog beamforming vector (ABFV), and power allocation until convergence. For both architectures, we further explore MA design strategies based on statistical channels, with the APV updated less frequently to reduce the antenna movement overhead. Simulation results demonstrate that our proposed algorithms achieve performance close to the derived bounds and also outperform the benchmark schemes using dense or sparse arrays with FPAs. 1972-2012 IEEE.

关键词： Near field communication

来源：评论

学校读者我要写书评

暂无评论

Mining World Indicators for Analyzing and Modeling the Development of Countries

引用

ACM/IMS Transactions on data science 2021年第4期2卷 1–27页

作者： Huang, Hong Chi, Mingyuan Song, Yu Jin, Hai The National Engineering Research Center for Big Data Technology and System Key Laboratory of Service Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

The world indicators released by the World Bank or other organizations usually give the basic public knowledge about the world. However, separate and static index lacks the complex interplay among different indicators and thus cannot help us have an overall understanding of the world. To this end, we study the world indicators from a different angle. Firstly, we discover that there exist correlations between indicators either from a static view or from a dynamic view. Moreover, taking the trade and diplomatic relationships into consideration, we construct a multi-relational network to depict the interactions between different countries, and propose a Multiple Relations to Vector (MR2vec) model to study world indicators from a network perspective. The experimental results show the changes of world indicators are predictable with the proposed model, and our proposed MR2vec has wide adaptability in predicting multi-relation networks. © 2022 Copyright held by the owner/author(s).

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

research on NARX wind speed prediction network based on Copula 27

Research on NARX wind speed prediction network based on Copu...

引用

27th International Conference on Automation and Computing, ICAC 2022

作者： Wu, Dizhi Dai, Jun Zhang, Taihao Yu, Shengping Xing, Bing Chen, Liangyin SiChuan University School of Computer Science ChengDu China The Second Research Institute CASRI ChengDu China Northeastern University Liaoning China Chongqing Innovation Center of Industrial Big-Data Chongqing China

ISBN: (数字)9781665498074

ISBN: (纸本)9781665498074

Accurate wind speed forecasting is the key to ensure the safe and stable access of wind energy to the grid system. Accurate wind speed forecasting can avoid the unnecessary loss of wind turbines due to high wind speed, and it is also helpful for wind power forecasting. However, the wind speed data is different from the general time series data, and the intermittency of the wind brings great volatility due to the weak continuity. There are a large number of peak points within the range of high wind speed. These peak points make it difficult to achieve accurate wind speed forecasting, no improvement method has been proposed for these wind speed characteristics in existing studies. This work proves the inaccuracy of maximum wind speed prediction through mathematical modeling, analyzes the correlation between meteorological data and wind speed in the data set, and proposes to take the most dependent meteorological data as an additional input to train the network, and through the copula connection function, it is proved that there is a tail dependence between the new parameters and the maximum wind speed. It can be used as a new method to improve the prediction accuracy of high wind speed peak. © 2022 IEEE.

关键词： Wind speed

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：