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

51st International Conference on Very Large data Bases, VLDB 2025

作者： Zhang, Shijie Cheng, Ru Liu, Xinpeng Xiao, Jiang Jin, Hai Li, Bo 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 Wuhan430074 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Increasingly popular decentralized applications (dApps) with complex application logic incur significant overhead for executing smart contract transactions, which greatly limits public block chain performance. Pre-executing transactions off the critical path can mitigate substantial I/O and computation costs during execution. However, pre-execution does not yield any state transitions, rendering the system state inconsistent with actual execution. This inconsistency can lead to deviations in pre-execution paths when processing smart contracts with multiple state-related branches, thus diminishing pre-execution effectiveness. In this paper, we develop Seer, a novel public block chain execution engine that incorporates fine-grained branch prediction to fully exploit pre-execution effectiveness. Seerpredicts state-related branches using a two-level prediction approach, reducing inconsistent execution paths more efficiently than executing all possible branches. To enable effective reuse of pre execution results, Seer employs checkpoint-based fast-path execution, enhancing transaction execution for both successful and unsuccessful predictions. Evaluations with realistic block chain workloads demonstrate that Seer delivers an average of 27.7× transaction-level speedup and an overall 20.6× speedup in the execution phase over vanilla Ethereum, outperforming existing block chain execution acceleration solutions. © 2025, VLDB Endowment, All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CDA-GNN: A Chain-driven Accelerator for Efficient Asynchronous Graph Neural Network 24

CDA-GNN: A Chain-driven Accelerator for Efficient Asynchrono...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Yu, Hui Zhang, Yu He, Ligang He, Donghao Li, Qikun Zhao, Jin Liao, Xiaofei Jin, Hai Gu, Lin Liu, Haikun National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798400706011

Asynchronous Graph Neural Network (AGNN) has attracted much research attention because it enables faster convergence speed than the synchronous GNN. However, existing software/hardware solutions suffer from redundant computation overhead and excessive off-chip communications for AGNN due to irregular state propagations along the dependency chains between vertices. This paper proposes a chain-driven asynchronous accelerator, CDA-GNN, for efficient AGNN inference. Specifically, CDA-GNN proposes a chain-driven asynchronous execution approach into novel accelerator design to regularize the vertex state propagations for fewer redundant computations and off-chip communications and also designs a chain-aware data caching method to improve data locality for AGNN. We have implemented and evaluated CDA-GNN on a Xilinx Alveo U280 FPGA card. Compared with the cutting-edge software solutions (i.e., Dorylus and AMP) and hardware solutions (i.e., BlockGNN and FlowGNN), CDA-GNN improves the performance of AGNN inference by an average of 1,173x, 182.4x, 10.2x, and 7.9x and saves energy by 2,241x, 242.2x, 12.4x, and 8.9x, respectively. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Self-training through Classifier Disagreement for Cross-Domain Opinion Target Extraction 23

Self-training through Classifier Disagreement for Cross-Doma...

引用

2023 World Wide Web Conference, WWW 2023

作者： Sun, Kai Zhang, Richong Samuel, Mensah Nikolaos, Aletras Mao, Yongyi Liu, Xudong Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China Department of Computer Science University of Sheffield Sheffield United Kingdom School of Electrical Engineering and Computer Science University of Ottawa Ottawa Canada

ISBN: (纸本)9781450394161

Opinion target extraction (OTE) or aspect extraction (AE) is a fundamental task in opinion mining that aims to extract the targets (or aspects) on which opinions have been expressed. Recent work focus on cross-domain OTE, which is typically encountered in real-world scenarios, where the testing and training distributions differ. Most methods use domain adversarial neural networks that aim to reduce the domain gap between the labelled source and unlabelled target domains to improve target domain performance. However, this approach only aligns feature distributions and does not account for class-wise feature alignment, leading to suboptimal results. Semi-supervised learning (SSL) has been explored as a solution, but is limited by the quality of pseudo-labels generated by the model. Inspired by the theoretical foundations in domain adaptation [2], we propose a new SSL approach that opts for selecting target samples whose model output from a domain-specific teacher and student network disagree on the unlabelled target data, in an effort to boost the target domain performance. Extensive experiments on benchmark cross-domain OTE datasets show that this approach is effective and performs consistently well in settings with large domain shifts. © 2023 ACM.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A Distributed Framework for Large-scale Protein-protein Interaction data Analysis and Prediction Using MapReduce

引用

IEEE/CAA Journal of Automatica Sinica 2022年第1期9卷 160-172页

作者： Lun Hu Shicheng Yang Xin Luo Huaqiang Yuan Khaled Sedraoui MengChu Zhou School of Computer Science and Technology Dongguan University of TechnologyDongguan 523808China School of Computer Science and Technology Wuhan University of TechnologyWuhan 430070China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent ComputingChongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Xinjiang Technical Institute of Physics and Chemistry Chinese Academy of SciencesUrumqi 830000China Center of Research Excellence in Renewable Energy and Power Systems and the Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA

Protein-protein interactions are of great significance for human to understand the functional mechanisms of *** the rapid development of high-throughput genomic technologies,massive protein-protein interaction(PPI)data have been generated,making it very difficult to analyze them *** address this problem,this paper presents a distributed framework by reimplementing one of state-of-the-art algorithms,i.e.,CoFex,using *** do so,an in-depth analysis of its limitations is conducted from the perspectives of efficiency and memory consumption when applying it for large-scale PPI data analysis and *** solutions are then devised to overcome these *** particular,we adopt a novel tree-based data structure to reduce the heavy memory consumption caused by the huge sequence information of *** that,its procedure is modified by following the MapReduce framework to take the prediction task distributively.A series of extensive experiments have been conducted to evaluate the performance of our framework in terms of both efficiency and *** results well demonstrate that the proposed framework can considerably improve its computational efficiency by more than two orders of magnitude while retaining the same high accuracy.

关键词： Distributed computing large-scale prediction machine learning MapReduce protein-protein interaction(PPI)

来源：评论

学校读者我要写书评

暂无评论

Mutual information oriented deep skill chaining for multi‐agent reinforcement learning

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 1014-1030页

作者： Zaipeng Xie Cheng Ji Chentai Qiao WenZhan Song Zewen Li Yufeng Zhang Yujing Zhang Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai UniversityNanjingChina College of Computer and Information Hohai UniversityNanjingChina Center for Cyber‐Physical Systems University of GeorgiaAthensGeorgiaUSA Information Networking Institute Carnegie Mellon UniversityPittsburghPennsylvaniaUSA Department of Electrical and Systems Engineering University of PennsylvaniaPhiladelphiaPennsylvaniaUSA

Multi‐agent reinforcement learning relies on reward signals to guide the policy networks of individual ***,in high‐dimensional continuous spaces,the non‐stationary environment can provide outdated experiences that hinder convergence,resulting in ineffective training performance for multi‐agent *** tackle this issue,a novel reinforcement learning scheme,Mutual Information Oriented Deep Skill Chaining(MioDSC),is proposed that generates an optimised cooperative policy by incorporating intrinsic rewards based on mutual information to improve exploration *** rewards encourage agents to diversify their learning process by engaging in actions that increase the mutual information between their actions and the environment *** addition,MioDSC can generate cooperative policies using the options framework,allowing agents to learn and reuse complex action sequences and accelerating the convergence speed of multi‐agent *** was evaluated in the multi‐agent particle environment and the StarCraft multi‐agent challenge at varying difficulty *** experimental results demonstrate that MioDSC outperforms state‐of‐the‐art methods and is robust across various multi‐agent system tasks with high stability.

关键词： artificial intelligence techniques decision making intelligent multi‐agent systems

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of computer Science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

PROVABLE SIM-TO-REAL TRANSFER IN CONTINUOUS DOMAIN WITH PARTIAL OBSERVATIONS 11

PROVABLE SIM-TO-REAL TRANSFER IN CONTINUOUS DOMAIN WITH PART...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Hu, Jiachen Zhong, Han Jin, Chi Wang, Liwei School of Computer Science Peking University China Center for Data Science Peking University China Department of Electrical and Computer Engineering Princeton University United States National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University Center for Data Science Peking University Beijing Institute of Big Data Research China

Sim-to-real transfer, which trains RL agents in the simulated environments and then deploys them in the real world, has been widely used to overcome the limitations of gathering samples in the real world. Despite the empirical success of the sim-to-real transfer, its theoretical foundation is much less understood. In this paper, we study the sim-to-real transfer in continuous domain with partial observations, where the simulated environments and real-world environments are modeled by linear quadratic Gaussian (LQG) systems. We show that a popular robust adversarial training algorithm is capable of learning a policy from the simulated environment that is competitive to the optimal policy in the real-world environment. To achieve our results, we design a new algorithm for infinite-horizon average-cost LQGs and establish a regret bound that depends on the intrinsic complexity of the model class. Our algorithm crucially relies on a novel history clipping scheme, which might be of independent interest. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prediction of futile recanalisation after endovascular treatment in acute ischaemic stroke:development and validation of a hybrid machine learning model

引用

Stroke & Vascular Neurology 2024年第6期9卷 631-639页

作者： Ximing Nie Jinxu Yang Xinxin Li Tianming Zhan Dongdong Liu Hongyi Yan Yufei Wei Xiran Liu Jiaping Chen Guoyang Gong Zhenzhou Wu Zhonghua Yang Miao Wen Weibin Gu Yuesong Pan Yong Jiang Xia Meng Tao Liu Jian Cheng Zixiao Li Zhongrong Miao Liping Liu Department of Neurology Capital Medical UniversityBeijingChina China National Clinical Research Center for Neurological Diseases Beijing Tiantan HospitalBeijingChina School of Computer and Communication Engineering University of Science and TechnologyBeijingChina Department of Radiology Beijing Tiantan HospitalBeijingChina Key Laboratory of Biomechanics and Mechanobiology Ministry of EducationSchool of Biological Science and Medical Engineering International Research Institute for Multidisciplinary ScienceBeihang UniversityBeijingChina Beijing Advanced Innovation Center for Big Data-Based Precision Medicine School of Computer Science and EngineeringBeihang UniversityBeijingChina Department of Interventional Neuroradiology Beijing Tiantan HospitalCapital Medical UniversityBeijingChina

Background Identification of futile recanalisation following endovascular therapy(EVT)in patients with acute ischaemic stroke is both crucial and ***,we present a novel risk stratification system based on hybrid machine learning method for predicting futile *** Hybrid machine learning models were developed to address six clinical scenarios within the EVT and perioperative management *** models were trained on a prospective database using hybrid feature selection technique to predict futile recanalisation following *** optimal model was validated and compared with existing models and scoring systems in a multicentre prospective cohort to develop a hybrid machine learning-based risk stratification system for futile recanalisation *** Using a hybrid feature selection approach,we trained and tested multiple classifiers on two independent patient cohorts(n=1122)to develop a hybrid machine learning-based prediction *** model demonstrated superior discriminative ability compared with other models and scoring systems(area under the curve=0.80,95%CI 0.73 to 0.87)and was transformed into a web application(RESCUE-FR Index)that provides a risk stratification system for individual prediction(accessible online atfr-index.biomind.cn/RESCUE-FR/).Conclusions The proposed hybrid machine learning approach could be used as an individualised risk prediction model to facilitate adherence to clinical practice guidelines and shared decision-making for optimal candidate selection and prognosis assessment in patients undergoing EVT.

关键词： database prediction optimal

来源：评论

学校读者我要写书评

暂无评论

ANIMC: A Soft Approach for Autoweighted Noisy and Incomplete Multiview Clustering

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第2期3卷 192-206页

作者： Fang, Xiang Hu, Yuchong Zhou, Pan Wu, Dapeng Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering The School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Information Storage System Ministry of Education of China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States

Multiview clustering has wide real-world applications because it can process data from multiple sources. However, these data often contain missing instances and noises, which are ignored by most multiview clustering methods. Missing instances may make these methods difficult to use directly, and noises will lead to unreliable clustering results. In this article, we propose a novel autoweighted noisy and incomplete multiview clustering (ANIMC) approach via a soft autoweighted strategy and a doubly soft regular regression model. First, by designing adaptive semiregularized nonnegative matrix factorization, the soft autoweighted strategy assigns a proper weight to each view and adds a soft boundary to balance the influence of noises and incompleteness. Second, by proposing θ-norm, the doubly soft regularized regression model adjusts the sparsity of our model by choosing different θ. Compared with previous methods, ANIMC has three unique advantages: 1) it is a soft algorithm to adjust our approach in different scenarios, thereby improving its generalization ability;2) it automatically learns a proper weight for each view, thereby reducing the influence of noises;3) it performs doubly soft regularized regression that aligns the same instances in different views, thereby decreasing the impact of missing instances. Extensive experimental results show its superior advantages over other state-of-the-art works. © 2020 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A computer-aided diagnosis system for breast pathology: a deep learning approach with model interpretability from pathological perspective

A computer-aided diagnosis system for breast pathology: a de...

引用

作者： Hsu, Wei-Wen Wu, Yongfang Chen, Chung-Hao Hao, Chang Hou, Yu-Ling Gao, Xiang Shao, Yun Zhang, Xueli He, Tao Tai, Yanhong Department of Computer Science and Information Technology National Taitung University Taitung Taiwan Department of Pathology The Fifth Medical Center of Chinese PLA General Hospital Beijing China Department of Electrical and Computer Engineering Old Dominion University NorfolkVA United States Institute of Big Data Technology Bright Oceans Corporation Beijing China

In this study, a computer-aided diagnosis (CAD) system for whole-slide images (WSIs) with breast cancer was proposed to achieve lesion detection and classification. Different from the previously proposed works that performed segmentation directly and applied the segmentation metrics for performance evaluation, here we computed the accuracy in patch-level, region-level, and slide-level to access our proposed framework to meet the clinical requirements, instead of simply regarding it as an AI segmentation task. To achieve that for WSIs, lesion detection was conducted at high magnification (× 40) first for region proposal by patching using the modified AlexNet model;and then, several patches were sampled from the detected regions at lower magnification (× 10) to observe cells’ patterns for lesion classification by the model of ResNet50. With such fashion, the deep features being distinguishing in lesion classification from the convolutional neural networks (CNN) were further analyzed in this work to provide comprehensive interpretability for the proposed CAD system based on pathological knowledge. For our experiments, a total of 186 slides of WSIs were collected and classified into three categories: Non-Carcinoma, Ductal Carcinoma in Situ (DCIS), and Invasive Ductal Carcinoma (IDC). The slide-level accuracy rate for the three-category classification reached 90.8% (99/109) through a fivefold cross-validation and achieved 94.8% (73/77) on the testing set. In addition, the learned features reflect the clinical insights in lesion classification for explainable AI, which enhanced the reliability and validity of our proposed system. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2023.

关键词： computer aided diagnosis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：