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

Dispatcher: Resource-aware Nakamoto Blockchain via Hierarchical Topology and Adaptive Incentives

Distributed Ledger Technologies: Research and Practice 2024年第2期3卷 1-20页

作者： Hai Jin Shuohua Dong Xiaohai Dai Yuandi Cai Jiang Xiao National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Mainstream blockchain systems such as Bitcoin and Ethereum are revolutionizing the financial industry by adopting the Nakamoto consensus protocol, i.e., Proof-of-Work (PoW). Only nodes with sufficient computing resources can work out the PoW difficulties, thereby increasing the mining cost of malicious attackers and ensuring the security of blockchain systems. Such an assumption of having abundant resources leads to drawbacks of low throughput and risk of centralization. In this article, we present Dispatcher, a novel distributed consensus protocol that takes resource heterogeneity into account to ensure resource-aware PoW with high efficiency. Dispatcher introduces a hierarchical topology to offer flexible PoW difficulties tailored for different nodes’ resources. In particular, it utilizes the limited resource of each node to jointly maximize the performance by concurrent mining. Moreover, we design an adaptive incentive mechanism to fit the available resource of blockchain nodes to rewards. Our experiments show that Dispatcher enjoys a substantial performance margin over the state-of-the-art. We can achieve a 50% throughput improvement compared with OHIE.

关键词： Blockchain resource heterogeneity incentive hierarchical architecture

来源：评论

学校读者我要写书评

暂无评论

Formalization of Android Activity-Fragment Multitasking Mechanism and Static Analysis of Mobile Apps

引用

Formal Aspects of computing 2025年第2期37卷 1-86页

作者： He, Jinlong Wu, Zhilin Chen, Taolue Key Laboratory of System Software Chinese Academy of Sciences Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China School of Computing and Mathematical Sciences Birkbeck University of London Northern Ireland London United Kingdom

The multitasking mechanism between activities and fragments plays a fundamental role in the Android operating system, which involves a wide range of features, including launch modes, intent flags, task affinities, and structured activities containing fragments. All of them are being widely used in Android apps, both open source and commercial ones. In this article, we present a formal semantics of the Android multitasking mechanism between activities and fragments, which accommodates all the important features and gives insofar the most comprehensive and accurate formalization. In particular, our semantics is formulated based on multi-stack systems, and fully captures the behavior of task stacks and activity stacks regarding fragments. Based on the semantics, we provide new static analysis algorithms, which are both multi-stack aware and fragment sensitive, thus achieve more precise static analysis for Android apps. We validate our approach by extensive experiments on both open source and commercial Android apps. The results highlight the benefits of the considering the semantics of the multitasking mechanism between activities and fragments in static analysis, and confirm the efficacy of our approach. © 2025 Copyright held by the owner/author(s).

关键词： Android multitasking mechanism activities and fragments formal semantics stack unboundedness static analysis

来源：评论

学校读者我要写书评

暂无评论

Class-Incremental Few-Shot Event Detection 30

Class-Incremental Few-Shot Event Detection

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Event detection is one of the fundamental tasks in information extraction and knowledge graph. However, a realistic event detection system often needs to deal with new event classes constantly. These new classes usually have only a few labeled instances as it is time-consuming and labor-intensive to annotate a large number of unlabeled instances. Therefore, this paper proposes a new task, called class-incremental few-shot event detection. Nevertheless, this task faces two problems, i.e., old knowledge forgetting and new class overfitting. To solve these problems, this paper further presents a novel knowledge distillation and prompt learning based method, called Prompt-KD. Specifically, to handle the forgetting problem about old knowledge, Prompt-KD develops an attention based multi-teacher knowledge distillation framework, where the ancestor teacher model pre-trained on base classes is reused in all learning sessions, and the father teacher model derives the current student model via adaptation. On the other hand, in order to cope with the few-shot learning scenario and alleviate the corresponding new class overfitting problem, Prompt-KD is also equipped with a prompt learning mechanism. Extensive experiments on two benchmark datasets, i.e., FewEvent and MAVEN, demonstrate the superior performance of Prompt-KD. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Towards Effective and Efficient Error Handling Code Fuzzing Based on Software Fault Injection 31

Towards Effective and Efficient Error Handling Code Fuzzing ...

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Chen, Kang Wen, Ming Jia, Haoxiang Wu, Rongxin Jin, Hai Wuhan430074 China Jin YinHu Laboratory Wuhan430074 China School of Informatics Xiamen University Xiamen361005 China School of Computer Science and Technology HUST Wuhan430074 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China

ISBN: (纸本)9798350330663

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL-F I are effective that contribute significantly to its overall performance. © 2024 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

A One-Dimensional Residual Network and Physical Fitness-Based Exercise Prescription Recommendation Method 10

A One-Dimensional Residual Network and Physical Fitness-Base...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Fan, Runqing Peng, Zhenlian Cao, Buqing Liu, Jianxun Che, Peng Chen, Tieping Hunan University of Science and Technology School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology School of Physical Education Xiangtan China

ISBN: (纸本)9798350312461

In the context of the national big data strategy, physical fitness test data has become one of the main influencing factors in guiding and promoting the participation of the population in sports and fitness. Recommending exercise prescriptions based on national physical fitness test data has become an important research topic. However, currently, there is little research on how to accurately use computer data processing technology to recommend exercise prescriptions based on physical fitness test data. In this study, we propose a ResNet-based Exercise Prescription (ResNet-EP) method that utilizes one-dimensional residual neural network technology to recommend exercise prescriptions based on physical fitness testing data. This method comprehensively analyzes physical fitness testing data and exercise prescription data and realizes the automatic recommendation of exercise prescriptions. Experimental results on a real dataset demonstrate that the ResNet-EP model outperforms other comparison models in terms of precision (79.98%), recall (83.73%), and F1 score (81.81%). This study provides novel insights into the combination of physical fitness testing and exercise. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A missing physical fitness test data classification method based on MLP 10

A missing physical fitness test data classification method b...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalable Cloud, CSCloud-EdgeCom 2023

作者： Che, Peng Peng, Zhenlian Cao, Buqing Liu, Jianxun Chen, Tieping Fan, Runqing Hunan University of Science and Technology School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology School of Physical Education Xiangtan China

ISBN: (纸本)9798350312461

In recent years, the physical health status of college students have been attached by the country and all universities. Much effort is spent every year to conduct physical health tests, generating a large amount of physical fitness data. Due to some irresistible reasons, such as entering incorrect data or students being unable to participate in some physical fitness programs, missing data exists in the physical fitness test, and the calculation of total points according to the existing rules of weighted summation may lead to inaccurate classification of some students grades. To this end, a classification method based on physical fitness test data with missing items is proposed in this paper. Firstly, the method collects the raw data set and constructs a structured data set. Then, the MLP method is used to construct a classifier model to classify the test data set with missing items. Finally, compared experiments are conducted with the training model constructed by GaussianNB, SVM and XGBoost and the results show that the classification effect of MLP is excellent, and the accuracy of classification can reach 93.29 %. © 2023 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Adaptive Evolutionary Reinforcement Learning Algorithm with Early Termination Strategy 23

Adaptive Evolutionary Reinforcement Learning Algorithm with ...

引用

23rd International Conference on Autonomous Agents and Multiagent systems, AAMAS 2024

作者： Wu, Xiaoqiang Zhu, Qingling Lin, Qiuzhen Chen, Weineng Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science and Engineering South China University of Technology Guangzhou China

Evolutionary reinforcement learning algorithms (ERLs), which combine evolutionary algorithms (EAs) with reinforcement learning (RL), have demonstrated significant success in enhancing RL performance. However, most ERLs rely heavily on Gaussian mutation operators to generate new individuals. When the standard deviation is too large or small, this approach will result in the production of poor or highly similar offspring. Such outcomes can be detrimental to the learning process of the RL agent, as too many poor or similar experiences are generated by these individuals. In order to alleviate these issues, this paper proposes an Adaptive Evolutionary Reinforcement Learning (AERL) method that adaptively adjusts both the standard deviation and the evaluation process. By tracking the performance of new individuals, AERL maintains the mutation strength within a suitable range without the need for additional gradient computations. Moreover, the proposed AERL approach early terminates unnecessary evaluations and discards experiences arising from poor individuals, thereby resulting in enhanced learning efficiency. Empirical assessments conducted on a variety of continuous control problems demonstrate the effectiveness of the AERL method. © 2024 International Foundation for Autonomous Agents and Multiagent systems.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

xGCN: An Extreme Graph Convolutional Network for Large-scale Social Link Prediction 23

xGCN: An Extreme Graph Convolutional Network for Large-scale...

引用

2023 World Wide Web Conference, WWW 2023

作者： Song, Xiran Lian, Jianxun Huang, Hong Luo, Zihan Zhou, Wei Lin, Xue Wu, Mingqi Li, Chaozhuo Xie, Xing Jin, Hai Huazhong University of Science and Technology Wuhan China Microsoft Research Asia Beijing China Microsoft Gaming Redmond United States National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781450394161

Graph neural networks (GNNs) have seen widespread usage across multiple real-world applications, yet in transductive learning, they still face challenges in accuracy, efficiency, and scalability, due to the extensive number of trainable parameters in the embedding table and the paradigm of stacking neighborhood aggregations. This paper presents a novel model called xGCN for large-scale network embedding, which is a practical solution for link predictions. xGCN addresses these issues by encoding graph-structure data in an extreme convolutional manner, and has the potential to push the performance of network embedding-based link predictions to a new record. Specifically, instead of assigning each node with a directly learnable embedding vector, xGCN regards node embeddings as static features. It uses a propagation operation to smooth node embeddings and relies on a Refinement neural Network (RefNet) to transform the coarse embeddings derived from the unsupervised propagation into new ones that optimize a training objective. The output of RefNet, which are well-refined embeddings, will replace the original node embeddings. This process is repeated iteratively until the model converges to a satisfying status. Experiments on three social network datasets with link prediction tasks show that xGCN not only achieves the best accuracy compared with a series of competitive baselines but also is highly efficient and scalable. © 2023 ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

OpticE: A Coherence Theory-Based Model for Link Prediction 29

OpticE: A Coherence Theory-Based Model for Link Prediction

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Gui, Xiangyu Zhao, Feng Jin, Langjunqing Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

Knowledge representation learning is a key step required for link prediction tasks with knowledge graphs (KGs). During the learning process, the semantics of each entity are embedded by a vector or a point in a feature space. The distance between these points is a measure of semantic similarity. However, in a KG, while two entities may have similar semantics in some relations, they have different semantics in others. It is ambiguous to assign a fixed distance to depict the variant semantic similarity of entities. To alleviate the semantic ambiguity in KGs, we design a new embedding approach named OpticE, which is derived from the well-known physical phenomenon of optical interference. It is a lightweight and relation-adaptive model based on coherence theory, in which each entity’s semantics vary automatically regarding different relations. In addition, a unique negative sampling method is proposed to combine the multimapping properties and self-adversarial learning during the training process. The experimental results obtained on practical KG benchmarks show that the OpticE model, with elegant structures, can compete with existing link prediction methods. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Multi Target Drug Design Method Based on Target Protein Sequence and Feature Similarity

A Multi Target Drug Design Method Based on Target Protein Se...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Haoran Lin, Xiaoli Hu, Jing Zhang, Xiaolong Wuhan University of Science and Technology Hubei Key Laboratory of Intelligent Information Processing and Real-Time Industrial System School of Computer Science and Technology Wuhan China

ISBN: (纸本)9798350386226

This paper describes a multi target drug design method based on features of the target proteins. The multi target drug which inhibit multiple proteins have prospective applications, but design is difficult. In this study, the target protein sequences are embedded to obtain target features. The features of each target are independently encoded as target latent vectors, and the features of multiple targets are jointly encoded as target similarity latent vectors. Based on the features of targets and the similarity features among the targets, multi target drugs are efficiently designed. In the experiments, the designed multi target drugs can be docked with target proteins with a proprietary molecular structure according to the requirements of different target pocket structures. The excellent fitness among the molecular structure of multi target drugs and the protein structure of multiple targets confirms the performance of the proposed method. In the molecular docking part of the experi¬ments, the binding affinity of designed multi target drugs is far better than that in the previous studies, which administrates the better performance of this work. © 2024 IEEE.

关键词： Molecular docking

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：