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

arXiv 2023年

作者： Wu, Jing Wang, Lin Jin, Qirui Liu, Fangming The National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab in The School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan430074 China Paderborn University TU Darmstadt Germany Peng Cheng Laboratory Huazhong University of Science and Technology China

Deep neural networks (DNNs) have been widely adopted for various mobile inference tasks, yet their ever-increasing computational demands are hindering their deployment on resource-constrained mobile devices. Hybrid deep learning partitions a DNN into two parts and deploys them across the mobile device and a server, aiming to reduce inference latency or prolong battery life of mobile devices. However, such partitioning produces (non-uniform) DNN fragments which are hard to serve efficiently on the server. This paper presents Graft—an efficient inference serving system for hybrid deep learning with latency service-level objective (SLO) guarantees. Our main insight is to mitigate the non-uniformity by a core concept called DNN re-alignment, allowing multiple heterogeneous DNN fragments to be restructured to share layers. To fully exploit the potential of DNN re-alignment, Graft employs fine-grained GPU resource sharing. Based on that, we propose efficient algorithms for merging, grouping, and re-aligning DNN fragments to maximize request batching opportunities, minimizing resource consumption while guaranteeing the inference latency SLO. We implement a Graft prototype and perform extensive experiments with five types of widely used DNNs and real-world network traces. Our results show that Graft improves resource efficiency by up to 70% compared with the state-of-the-art inference serving systems. © 2023, CC BY-NC-ND.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Temporal Knowledge Graph Reasoning via Time-Distributed Representation Learning

Temporal Knowledge Graph Reasoning via Time-Distributed Repr...

引用

IEEE International Conference on data Mining (ICDM)

作者： Kangzheng Liu Feng Zhao Guandong Xu Xianzhi Wang Hai Jin 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 Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Temporal knowledge graph (TKG) reasoning has attracted significant attention. Recent approaches for modeling historical information have led to great advances. However, the problems of time variability and unseen entities have become two major obstacles preventing further development. The time variability problem means that different historical timestamps play different roles in the inference process. Furthermore, in the context of time variability, the unseen entity problem means that a query cannot obtain a predicted entity that is unseen in the scale-varying history rather than in a fixed set, thus turning from static to dynamic. In this paper, we propose a novel method named DHU-NET for addressing the time variability challenge and the dynamic unseen entity challenge derived from it. With regard to the former concern, we propose a time-distributed representation learning method based on a graph convolutional network(GCN) and a self-attention mechanism, which learns the distributed representations of facts at different historical timestamps and comprehensively pays different levels of attention to the different timestamps. With regard to the latter issue, we extract the unseen entities from a global static KG based on a copy mechanism and bring them into consideration during the final prediction step. Experiments on six benchmark datasets demonstrate the substantial improvements achieved by DHUNET in terms of multiple evaluation metrics. Our released codes are available at https://***/CGCL-codes/DHUNET.

关键词： Representation learning Measurement Knowledge engineering Predictive models Turning Cognition data models

来源：评论

学校读者我要写书评

暂无评论

RSP-gcForest: A Distributed Deep Forest via Random Sample Partition

RSP-gcForest: A Distributed Deep Forest via Random Sample Pa...

引用

IEEE International Conference on big data

作者： Mark Junjie Li Wenzhu Cai Yigang Lin Sunjie Huang Joshua Zhexue Huang Patrick Xiaogang Peng College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Academy of Inspection and Quarantine

Deep Forest, a powerful alternative to deep neural networks, has gained much attention due to its advantages, such as low complexity, minimal hyperparameter requirements, and strong application performance. In the current big data environment, where data volumes and model complexities are growing rapidly, distributed computing is needed to increase computational efficiency. Recently, a distributed deep forest approach, called BLB-gcForest (Bag of Little Bootstraps-gcForest), has been successful in reducing training instances within cascade forests, combining BLB and granularity segmentation, thus improving the computational efficiency and scalability of distributed deep forests. However, it still transmits the entire data set between layers and requires double sampling with BLB, limiting the amount of data and the scalability of resource utilization. This paper introduces a novel algorithm, RSP-gcForest, based on Random Sample Partition (RSP) to improve distributed deep forests computational efficiency and scalability. RSP-gcForest uses block-level samples that replace the full dataset, significantly reducing interlayer instance transmission and prediction within cascade forests. Additionally, RSP blocks are integrated with the segmentation granularity of cascade forests for ensemble learning, effectively addressing computational efficiency and resource constraints. We conducted experiments on four extensive datasets using Spark and evaluated performance across five key metrics. The results clearly show that RSP-gcForest, while maintaining high classification quality, surpasses state-of-the-art methods in terms of computational efficiency and resource utilization. Furthermore, it achieves superior load balancing, demonstrating its potential as a powerful tool in big data and distributed computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Efficient Block Validation Mechanism for UTXO-based Blockchains

An Efficient Block Validation Mechanism for UTXO-based Block...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Bin Xiao Jiang Xiao Hai Jin 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 Department of Computing The Hong Kong Polytechnic University Hong Kong

It has been recognized that one of the bottlenecks in the UTXO-based blockchain systems is the slow block validation - the process of validating a newly-received block by a node before locally storing it and further broadcasting it. As a block contains multiple inputs, the block validation mainly involves checking the inputs against the status data, which is also known as the Unspent Transaction Outputs (UTXO) set. As time goes by, the UTXO set becomes more and more expansive, most of which can only be stored on disks. This considerably slows down the input checking and thus block validation, which can potentially compromise system security. To deal with the above problem, we disassemble the function of input checking into three parts: existence validation (EV), unspent validation (UV), and script validation (SV). Based on the disassembly, we propose EBV, an efficient block validation mechanism to speed up EV, UV, and SV individually. First, EBV changes the representation of status data, from UTXO set to a bit-vector set, which drastically reduces its size. The smaller status data can be entirely maintained in memory, thereby accelerating UV and also block validation. Second, EBV requires each transaction to carry the proof data, which enables EV and SV without accessing the disks. Furthermore, we also cope with two challenges in the design of EBV, namely transaction inflation and fake positions. To evaluate the EBV mechanism, we implement a prototype on top of Bitcoin, the most widely known UTXO-based blockchain, and conduct extensive experiments to compare EBV and Bitcoin. The experimental results demonstrate that EBV successfully reduces the memory requirement by 93.1 % and the block validation time by up to 93.5%.

关键词： Distributed processing Memory management Prototypes Bitcoin Broadcasting Blockchains Delays

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Co-Evolution Algorithm with Variable-Importance Grouping for Large-Scale Optimization 13

A Cooperative Co-Evolution Algorithm with Variable-Importanc...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Li, Yongfeng Zhang, Yuze Ma, Lijia Ji, Junkai Liu, Dugang Leung, Victor C. M. Li, Jianqiang Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen518123 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen518172 China The University of British Columbia Department of Electrical and Computer Engineering VancouverV6T 1Z4 Canada

ISBN: (纸本)9798350308365

Cooperative co-evolution (CC) is a promising direction in solving large-scale multiobjective optimization problems (LMOPs). However, most existing methods of grouping decision variables face some difficulties when searching in the huge search space. Specifically, the methods of grouping decision variables can be classified into two types, i.e., high-consumption grouping methods and non-consumption grouping methods. On the one hand, the former ones divide the decision variables into different groups based on the correlation analysis between variables, which consume much evaluation. This way may lead to premature convergence within limited computational resources. On the other hand, the later ones allocate the decision variables into sub-groups based on some metrics, e.g., order and size, which consume no evaluation while may cause the search fall into local optima. To alleviate the above issues, this paper proposes a CC-based algorithm with a variable-importance grouping (VIG) method, called VICCA. Firstly, the decision variables are classified into several subgroups according to their importance quantified by a meta-gene construction method. Secondly, a CC strategy is designed to simultaneously optimize all subgroups of decision variables formed by VIG using the differential evolution operator, which aims to accelerate the convergence speed. Thirdly, a global evolutionary strategy is proposed to optimize original decision variable space by the competitive swarm optimizer, aiming to maintain the diversity. Finally, the experiments demonstrate that our proposed VICCA has the significant advantage in solving LMOPs when compared with state-of-the-art evolutionary algorithms. © 2024 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Robin: A Novel Method to Produce Robust Interpreters for Deep Learning-Based Code Classifiers

arXiv

引用

arXiv 2023年

作者： Li, Zhen Zhang, Ruqian Zou, Deqing Wang, Ning Li, Yating Xu, Shouhuai Chen, Chen Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Colorado Colorado Springs United States Center for Research in Computer Vision University of Central Florida United States School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

Deep learning has been widely used in source code classification tasks, such as code classification according to their functionalities, code authorship attribution, and vulnerability detection. Unfortunately, the black-box nature of deep learning makes it hard to interpret and understand why a classifier (i.e., classification model) makes a particular prediction on a given example. This lack of interpretability (or explainability) might have hindered their adoption by practitioners because it is not clear when they should or should not trust a classifier's prediction. The lack of interpretability has motivated a number of studies in recent years. However, existing methods are neither robust nor able to cope with out-of-distribution examples. In this paper, we propose a novel method to produce Robust interpreters for a given deep learning-based code classifier;the method is dubbed Robin. The key idea behind Robin is a novel hybrid structure combining an interpreter and two approximators, while leveraging the ideas of adversarial training and data augmentation. Experimental results show that on average the interpreter produced by Robin achieves a 6.11% higher fidelity (evaluated on the classifier), 67.22% higher fidelity (evaluated on the approximator), and 15.87x higher robustness than that of the three existing interpreters we evaluated. Moreover, the interpreter is 47.31% less affected by out-of-distribution examples than that of LEMNA. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Generative Positive-Unlabeled Classification for Hunting Small Open Reading Frames

Generative Positive-Unlabeled Classification for Hunting Sma...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jie Chen Wenbin Liao Du Wen Jianqiang Li Fangzhong Wang College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Laboratory of Synthetic Microbiology School of Chemical Engineering & Technology Tianjin University China

The annotation of Open Reading Frames (ORFs) is a crucial step in gene annotation, as it precisely delineates the specific regions of expressed genes. However, small Open Reading Frames (smORFs), in comparison to ORFs, are shorter in length, exhibit lower expression abundance, and are more challenging to predict. Particularly in the presence of noise in prokaryotic data and limited availability of positive sample data, the difficulty of prediction is amplified. Therefore, it is necessary to study smORF prediction methods. However, current machine learning models use limited data for modeling and overlook the existence of undiscovered positive samples within the negative samples. Additionally, they do not incorporate prior knowledge that can be calibrated to enhance the 3-nt periodicity. This work utilizes a multimodal VAE for data dimensionality reduction and employs a GAN to generate latent vectors for data augmentation. It incorporates PU learning to leverage unknown samples and combines Riboseq data from experiments with and without antibiotic treatment. Additionally, an adversarial training mechanism is employed to enhance the model’s robustness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Network for Segmenting Pathology Lesion of the Focal Lymphocytic Sialadenitis

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Ne...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Hao Han Feng Lu Yanhan Deng Xiaofang Luo Hai Jin Wei Tu Xia Xie 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 Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

In the medical realm, the pivotal role of pathological Whole Slide Images (WSIs) in detecting cancer, tracking disease progression, and evaluating treatment efficacy is indisputable. Nevertheless, the identification and quantification of lesion areas in these gigapixel WSIs present a significant challenge due to their substantial size and the intricate details of lesions. To address these issues, we developed a novel multi-resolution and multi-scale cross fusion network (M 2 CF-Net), adept at managing large-scale pathological WSIs and capturing both fine details and context. Our model particularly focuses on segmenting local lymphocyte infiltration lesions in pathological WSIs of patients diagnosed with primary Sjogren's syndrome. By employing a patch-based training approach and combining interconnected elements via a multi-scale fusion technique, we enhance our model's capacity to detect and analyze structures and features in minor salivary gland section WSIs. Extensive experiments and ablation studies conducted on real-world clinical datasets affirm our model's superior accuracy in identifying lymphocyte-infiltrated regions over state-of-the-art models, with a performance improvement of up to 4.32% in terms of the Dice Similarity Coefficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dual Encoders for Diffusion-based Image Inpainting

Dual Encoders for Diffusion-based Image Inpainting

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Dezhi Zheng Kaijun Deng Jinbao Wang Linlin Shen Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Current diffusion-based inpainting models struggle to preserve unmasked regions or generate highly coherent content. Additionally, it is hard for them to generate meaningful content for 3D inpainting. To tackle these challenges, we design a plug-and-play branch that runs through the entire generation process to enhance existing models. Specifically, we utilize dual encoders - a Convolutional Neural Network (CNN) encoder and the pre-trained Variational AutoEncoder (VAE) encoder, to encode masked images. The latent code and the feature map from the dual encoders are fed to diffusion models simultaneously. In addition, we apply Zero-padded initialization to solve the problem of mode collapse caused by this branch. Experiments on BrushBench and EditBench demonstrate that models with our plug-and-play branch can improve the coherence of inpainting, and our model achieves new state-of-the-art results.

关键词： Visualization Three-dimensional displays Codes Autoencoders Coherence Signal processing Diffusion models Decoding Convolutional neural networks Speech processing

来源：评论

学校读者我要写书评

暂无评论

Sharing Economy in Local Energy Markets

引用

Journal of Modern Power systems and Clean Energy 2023年第3期11卷 714-726页

作者： Zhaoyuan Wu Jianxiao Wang Haiwang Zhong Feng Gao Tianjiao Pu Chin-Woo Tan Xiupeng Chen Gengyin Li Huiru Zhao Ming Zhou Qing Xia School of Economics and Management North China Electric Power UniversityBeijing 102206China State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources North China Electric Power UniversityBeijing 102206China National Engineering Laboratory for Big Data Analysis and Applications Peking UniversityBeijing 100871China State Key Lab of Power Systems Department of Electrical EngineeringTsinghua UniversityBeijing 100084China Department of Industrial Engineering and Management College of EngineeringPeking UniversityBeijing 100871China China Electric Power Research Institute Beijing 100192China Department of Civil and Environmental Engineering Stanford UniversityPalo AltoCA 94305USA Engineering and Technology Institute Groningen University of Groningen9742 AG Groningenthe Netherlands

With an increase in the electrification of end-use sectors,various resources on the demand side provide great flexibility potential for system operation,which also leads to problems such as the strong randomness of power consumption behavior,the low utilization rate of flexible resources,and difficulties in cost *** the core idea of“access over ownership”,the concept of the sharing economy has gained substantial popularity in the local energy market in recent ***,we provide an overview of the potential market design for the sharing economy in local energy markets(LEMs)and conduct a detailed review of research related to local energy sharing,enabling technologies,and potential *** paper can provide a useful reference and insights for the activation of demand-side flexibility ***,this paper can also provide novel insights into the development and further integration of the sharing economy in LEMs.

关键词： Energy sharing flexibility potential local energy market information and communication technology sharing economy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：