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

Demystifying Ethereum account diversity:observations,models and analysis

Frontiers of Computer Science 2022年第4期16卷 119-130页

作者： Chaofan Wang Xiaohai Dai Jiang Xiao Chenchen Li Ming Wen Bingbing Zhou Hai Jin Clusters and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Centre for Distributed and High Performance Computing School of Information TechnologiesThe University of SydneyCamperdownNew South Wales2006Australia

Blockchain platform Ethereum has involved millions of accounts due to its strong potential for providing numerous services based on smart *** massive accounts can be divided into diverse categories,such as miners,tokens,and exchanges,which is termed as account diversity in this *** benefit of investigating diversity are multi-fold,including understanding the Ethereum ecosystem deeper and opening the possibility of tracking certain abnormal ***,the exploration of blockchain account diversity remains *** the most relevant studies,which focus on the deanonymization of the accounts on Bitcoin,can hardly be applied on Ethereum since their underlying protocols and user idioms are *** this end,we present the first attempt to demystify the account diversity on *** key observation is that different accounts exhibit diverse behavior patterns,leading us to propose the heuristics for classification as the *** then raise the coverage rate of classification by the statistical learning model Maximum Likelihood Estimation(MLE).We collect real-world data through extensive efforts to evaluate our proposed method and show its ***,we make an in-depth analysis of the dynamic evolution of the Ethereum ecosystem and uncover the abnormal arbitrage *** for the former,we validate two sweeping statements reliably:(1)standalone miners are gradually replaced by the mining pools and cooperative miners;(2)transactions related to the mining pool and exchanges take up a large share of the total *** latter analysis shows that there are a large number of arbitrage transactions transferring the coins from one exchange to another to make a price difference.

关键词： blockchain Ethereum classification account diversity network analysis

来源：评论

学校读者我要写书评

暂无评论

Identification of Key Genes as Potential Drug Targets for Gastric Cancer

引用

Tsinghua Science and Technology 2023年第4期28卷 649-664页

作者： Md.Tofazzal Hossain Md.Selim Reza Yin Peng Shengzhong Feng Yanjie Wei Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis TechnologyShenzhen Institute of Advanced TechnologyChinese Academy of SciencesShenzhen 518055China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 100049China Department of Statistics Bangabandhu Sheikh Mujibur Rahman Science and Technology UniversityGopalganj 8100Bangladesh Guangdong Provincial Key Laboratory for Genome Stability and Disease Prevention and Regional Immunity and Diseases Department of PathologyShenzhen UniversityShenzhen 518060China

Gastric cancer(GC)is one of the most common cancers and ranks the third in cancer mortality all over the *** goal of this study was to identify potential hub-genes,highlighting their functions,signaling pathways,and candidate drugs for the treatment of GC *** used publicly available next generation sequencing(NGS)data to identify differentially expressed(DE)*** top DE genes were mapped to STRING database to construct the protein-protein interaction(PPI)network and top hub genes were selected for further *** found a total of 1555 DE genes with 870 upregulated and 685 downregulated genes in *** selected the top 400(200 upregulated and 200 downregulated)genes to construct a PPI network and extracted the top 15 hub *** gene ontology(GO)term and kyoto encyclopedia of genes and genomes(KEGG)pathway enrichment analyses of the 15 hub genes exposed some important functions and signaling pathways that were significantly associated with GC *** survival analysis of the hub genes disclosed that the lower expressions of the three hub genes CDH2,COL4A1,and COL5A2 were associated with better survival of GC *** three genes might be the candidate biomarkers for the diagnosis and treatment of ***,we considered 3 key proteins(genomic biomarkers)(COL4A1,CDH2,and CO5A2)as the drug target proteins(receptors),performed their docking analysis with the 102 meta-drug agents,and found Everolimus,Docetaxel,Lanreotide,Venetoclax,Temsirolimus,and Nilotinib as the top ranked 6 candidate drugs with respect to our proposed target proteins for the treatment against GC ***,the proposed drugs might play vital role for the treatment against GC patients.

关键词： gastric cancer hub genes candidate genes molecular docking candidate drugs

来源：评论

学校读者我要写书评

暂无评论

Boosting Meaningful Dependency Mining with Clustering and Covariance Analysis 40

Boosting Meaningful Dependency Mining with Clustering and Co...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Wang, Xi Jin, Ruochun Huang, Wanrong Tang, Yuhua Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha China College of Computer Science and Technology Department of Intelligent Data Science National University of Defense Technology Changsha China

ISBN: (纸本)9798350317152

Functional dependencies (FDs) form a valuable ingredient for various data management tasks. However, existing methods can hardly discover practical and interpretable FDs, especially in large noisy real-life datasets. This paper studies the problem of discovering meaningful functional dependencies (FDms) that utilize support and error parameters to capture interesting dependencies in such datasets and proposes an efficient discovery algorithm called FDM?. In order to scale with large datasets, FDM ? employs an efficient sampling method with accuracy guarantees to capture the differences between tuple pairs and to quantify the connection between support/error of dependencies on samples and those on the entire dataset. Moreover, it adopts a clustering-based correlated attributes extraction to divide the exponentially large search space into multiple small sub-spaces and proposes an easy-first traversal strategy with covariance-based guidance that quickly detects candidate dependencies and validates them. Additionally, we prove a covariance lower bound as an additional pruning criterion to reduce the search space. Extensive experiments on real-life and synthetic datasets demonstrate that FDM ? is 14 times faster than existing discovery algorithms on average, up to 31 times, and scales to larger datasets with the least memory cost. © 2024 IEEE.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

BERD+: A Generic Sequential Recommendation Framework by Eliminating Unreliable data with Item- and Attribute-level Signals

引用

ACM Transactions on Information Systems 2023年第2期42卷 1-33页

作者： Sun, Yatong Yang, Xiaochun Sun, Zhu Wang, Bin School of Computer Science and Engineering Northeastern University School of Computing Macquarie University China Australia Institute of High Performance Computing Centre for Frontier AI Research A*STAR Singapore School of Computer Science and Engineering Northeastern University China National Frontiers Science Center for Industrial Intelligence and Systems Optimization China Key Laboratory of Data Analytics and Optimization for Smart Industry [Northeastern University Ministry of Education China

A preliminary work of our study was published at IJCAI’21 [47], which is substantially extended in the following aspects: (1) In Section 1, we analyze the necessity of introducing item attributes for detecting unreliable instances, together with the problems and challenges that attributes may bring in. (2) In Section 2, we add discussions about the limitations of existing attribute-aware recommender systems (Section 2.2) and denoising methods (Section 2.3) in the context of detecting unreliable instances. (3) In Section 4.2, we further conduct an in-depth analysis at the attribute level to demonstrate the capability of attributes for rectifying instance loss and uncertainty, as well as the disturbance caused by attributes. (4) We generalize BERD to a generic framework BERD+ in Section 5.1, equipped with novel modules, i.e., HU-GCN (Section 5.2) and EPE (Section 5.4), which properly incorporate item attributes while reducing their disturbance for rectifying instance uncer tainty (Section 5.5) and loss (Section 5.6). The generic BERD+ can be flexibly plugged into existing SRSs for performance enhanced recommendation via eliminating unreliable data. (5) In Section 6.2, we apply our BERD+ framework to seven state-of-the-art SRSs on five real-world datasets to illustrate its superiority. (6) To avoid unfair comparison caused by item attributes, we build and compare with the baseline that combines the original BERD and an advanced attribute-aware recommender system, KSR [19]. (7) For more comprehensive comparison, in Section 6.2.2, we compare BRED+ with two state-of-the-art denoising approaches;in Section 6.2.3, to examine the efficacy of HU-GCN and EPE, we compare HU-GCN with various attribute embedding techniques, i.e., variants of graph neural networks, and compare EPE with different attribute fusing methods, i.e., adding, concatenation, and weighted sum. (8) In Section 6.2.4, a detailed ablation study is conducted to verify the effectiveness of each module of BERD+. (

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Robust and digital hyper-polarization protocol of nuclear spins via magic sequential sequence

arXiv

引用

arXiv 2025年

作者： Li, Haiyang Liao, Hao Wang, Ping Faculty of Arts and Sciences Beijing Normal University Zhuhai519087 China National Engineering Laboratory on Big Data System Computing Technology Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

Hyper-polarization of nuclear spins is crucial for advancing nuclear magnetic resonance (NMR) and quantum information technologies, as nuclear spins typically exhibit extremely low polarization at room temperature due to their small gyro-magnetic ratios. A promising approach to achieving high nuclear spin polarization is transferring the polarization of electron to nuclear spin. The nitrogen-vacancy (NV) center in diamond has emerged as a highly effective medium for this purpose, and various hyper-polarization protocols have been developed. Among these, the pulsed polarization (PulsePol) method has been extensively studied due to its robustness against static energy shifts of the electron spin. In this study, we introduce a sequential polarization protocol and identify a series of magic and digital sequences for hyper-polarizing nuclear spins. Notably, we demonstrate that some of these magic sequences exhibit significantly greater robustness compared to the PulsePol protocol in the presence of finite half π pulse duration of the protocol. This enhanced robustness positions our protocol as a more suitable candidate for hyper-polarizing nuclear spins species with large gyromagnetic ratios and also ensures better compatibility with high-efficiency readout techniques at high magnetic fields. Additionally, the generality of our protocol allows for its direct application to other solid-state quantum systems beyond the NV center. © 2025, CC BY.

关键词： Chemical shift

来源：评论

学校读者我要写书评

暂无评论

IMPRESS: an importance-informed multi-tier prefix KV storage system for large language model inference 25

IMPRESS: an importance-informed multi-tier prefix KV storage...

引用

Proceedings of the 23rd USENIX Conference on File and Storage Technologies

作者： Weijian Chen Shuibing He Haoyang Qu Ruidong Zhang Siling Yang Ping Chen Yi Zheng Baoxing Huai Gang Chen The State Key Laboratory of Blockchain and Data Security Zhejiang University and Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security and Zhejiang Key Laboratory of Big Data Intelligent Computing The State Key Laboratory of Blockchain and Data Security Zhejiang University Huawei Cloud

ISBN: (纸本)9781939133458

Modern advanced large language model (LLM) applications often prepend long contexts before user queries to improve model output quality. These contexts frequently repeat, either partially or fully, across multiple queries. Existing systems typically store and reuse the keys and values of these contexts (referred to as prefix KVs) to reduce redundant computation and time to first token (TTFT). When prefix KVs need to be stored on disks due to insufficient CPU memory, reusing them does not always reduce TTFT, as disk I/O latency is high. In this paper, we propose IMPRESS, an importance-informed multi-tier prefix KV storage system to reduce I/O delay for LLM inference by only loading important prefix KVs. IMPRESS first leverages the insight that there is significant similarity in important token index sets across attention heads and introduces an I/O-efficient important KV identification algorithm. It then optimizes prefix KV storage and caching through importance-informed KV management, reducing TTFT during model inference. Our experimental results show that IMPRESS can reduce TTFT by up to 2.8× compared to state-of-the-art systems, while maintaining comparable inference accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LeapGNN: accelerating distributed GNN training leveraging feature-centric model migration 25

LeapGNN: accelerating distributed GNN training leveraging fe...

引用

Proceedings of the 23rd USENIX Conference on File and Storage Technologies

作者： Weijian Chen Shuibing He Haoyang Qu Xuechen Zhang The State Key Laboratory of Blockchain and Data Security Zhejiang University and Zhejiang Lab and Hangzhou High-Tech Zone (Binjiang) Institute of Blockchain and Data Security and Zhejiang Key Laboratory of Big Data Intelligent Computing Washington State University Vancouver

ISBN: (纸本)9781939133458

Distributed training of graph neural networks (GNNs) has become a crucial technique for processing large graphs. Prevalent GNN frameworks are model-centric, necessitating the transfer of massive graph vertex features to GNN models, which leads to a significant communication bottleneck. Recognizing that the model size is often significantly smaller than the feature size, we propose LeapGNN, a feature-centric framework that reverses this paradigm by bringing GNN models to vertex features. To make it truly effective, we first propose a micrograph-based training strategy that leverages a refined structure to enhance locality, combined with the model migration technique, to minimize remote feature retrieval. Then, we devise a feature pre-gathering approach that merges multiple fetch operations into a single one to eliminate redundant feature transmissions. Finally, we employ a micrograph-based merging method that adjusts the number of micrographs for each worker to minimize kernel switches and synchronization overhead. Our experimental results demonstrate that LeapGNN achieves a performance speedup of up to 4.2× compared to the state-of-the-art method, namely P3.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph algorithms: parallelization and scalability

引用

Science China(Information Sciences) 2020年第10期63卷 234-254页

作者： Wenfei FAN Kun HE Qian LI Yue WANG School of Informatics University of Edinburgh Shenzhen Institute of Computing Sciences Shenzhen University Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen University

For computations on large-scale graphs, one often resorts to parallel algorithms. However, parallel algorithms are difficult to write, debug and analyze. Worse still, it is difficult to make algorithms parallelly scalable, such that the more machines are used, the faster the algorithms run. Indeed, it is not yet known whether any PTIME computational problems admit parallelly scalable algorithms on shared-nothing *** it possible to parallelize sequential graph algorithms and guarantee convergence at the correct results as long as the sequential algorithms are correct? Moreover, does a PTIME parallelly scalable problem exist on shared-nothing systems? This position paper answers both questions in the affirmative.

关键词： parallelization parallel scalability PTIME problems graph algorithms shared-nothing systems

来源：评论

学校读者我要写书评

暂无评论

Federated Domain Generalization for Fault Diagnosis: Cross-Client Style Integration and Dual Alignment Representation

引用

IEEE Internet of Things Journal 2025年

作者： Wang, Yu Zhang, Guowei Kong, Xianguang Du, Jingli Ma, Hongbo Yunnan Agricultural University College of Big Data Kunming650500 China Xidian University College of Mechanical and Electrical Engineering Xian710071 China State Key Laboratory of Electromechanical Integrated Manufacturing of High-performance Electronic Equipments China

Federated learning (FL) enables the collaborative training of intelligent diagnostic models across multiple clients while preserving data privacy. However, the complex and dynamic working conditions often cause federated diagnostic models to suffer from performance degradation when applied to unseen clients, exposing deficiencies in model generalization. Domain generalization fault diagnosis methods aim to enhance model adaptability under unknown working conditions, but most existing algorithms rely on shared data, making them unsuitable for direct application in federated learning environments. To address this challenge, we propose a federated domain generalization fault diagnosis method based on Cross-Client Style Integration and Dual Alignment representation (CCSIDA). This method significantly enhances model generalization in FL settings while ensuring data privacy. Specifically, CCSIDA integrates three key strategies: cross-client style data enhancement, domain-sensitive feature suppression, and predictive alignment. For cross-client style integration, we design a stochastic mixed-style sample generation module to overcome the limitations of conventional domain generalization data enhancement methods in FL. This module generates diverse samples by constructing a shared style repository, enabling inter-client style information transfer. For cross-client dual alignment representation, we introduce a domain-sensitive feature suppression strategy to reduce domain discrepancies between original and enhanced samples. Additionally, Jensen-Shannon divergence is employed to ensure prediction consistency between these samples. Finally, extensive experiments on five benchmark datasets validate the effectiveness of the proposed method. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Disentangled latent factors for muti-cause treatment effect estimation 6

Disentangled latent factors for muti-cause treatment effect ...

引用

2024 6th International Conference on Artificial Intelligence Technologies and Applications, ICAITA 2024

作者： Zhao, Zhuoyue Wang, Haotian Xu, Liyang Wang, Qian Tang, Yuhua Department of Intelligent Data Science National University of Defense Technology Changsha410073 China Intelligent Game and Decision Lab. Academy of Military Science Beijing100071 China Institute for Quantum Information State Key Laboratory of High-Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China

Existing methods estimate treatment effects from observational data and assume that covariates are all confounders. However, observed covariates may not directly represent confounding variables that influence both treatment and outcome. They always include variables that only affect the treatment or the outcome. In addition, for multi-dimensional binary treatments, disentangled methods are mainly designed for binary variables and ignore the impact of multi-cause treatment variables on the inference of latent factors. To address these two issues, based on variable decomposition and proxy inference, we propose the Disentangled Latent Factors for Multi-cause Treatment Estimation (DEMTE) algorithm. It utilizes an identifiable autoencoder to infer and disentangle latent factors based on the joint distribution of variables in observational data. DEMTE evaluates the treatment effect on the disentangled factors. Synthetic experiments and semi-synthetic experiments demonstrate the effectiveness of the inference and disentanglement techniques and our method achieves more accurate treatment effect estimation. © 2024 Institute of Physics Publishing. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：