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

Optimizing the Copy-on-Write Mechanism of Docker by Dynamic Prefetching

Tsinghua Science and Technology 2021年第3期26卷 266-274页

作者： Yan Jiang Wei Liu Xuanhua Shi Weizhong Qiang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHuazhong University of Science and TechnologyWuhan 430074China

Docker,as a mainstream container solution,adopts the Copy-on-Write(CoW)mechanism in its storage *** mechanism satisfies the need of different containers to share the same ***,when a single container performs operations such as modification of an image file,a duplicate is created in the upper readwrite layer,which contributes to the runtime *** the accessed image file is fairly large,this additional overhead becomes *** we present the concept of Dynamic Prefetching Strategy Optimization(DPSO),which optimizes the Co W mechanism for a Docker container on the basis of the dynamic prefetching *** the beginning of the container life cycle,DPSO pre-copies up the image files that are most likely to be copied up later to eliminate the overhead caused by performing this operation during application *** experimental results show that DPSO has an average prefetch accuracy of greater than 78%in complex scenarios and could effectively eliminate the overhead caused by the CoW mechanism.

关键词： Docker container Copy-on-Write(CoW) storage driver prefetch strategy

来源：评论

学校读者我要写书评

暂无评论

MCT-Net: a multi-branch hybrid CNN-transformer model for medical image segmentation

引用

Pattern Analysis and Applications 2025年第2期28卷 1-21页

作者： Shen, Longfeng Diao, Liangjin Peng, Rui Chen, Jiacong Lu, Zhengtian Ge, Fangzhen Anhui Engineering Research Center for Intelligent Computing and Application on Cognitive Behavior (ICACB) College of Computer Science and Technology Huaibei Normal University Anhui Huaibei China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China Anhui Big-Data Research Center on University Management Huaibei Normal University Anhui Huaibei China

In recent years, neural networks have demonstrated substantial progress in medical image segmentation. However, accurately segmenting objects in medical images is often restricted by edge blurring, which complicates the delineation of structures of interest. The purpose of this study is to develop a multi-branch hybrid CNN-transformer model to address the issue of edge blurring in medical image segmentation. This approach enables more precise edge detection and segmentation. Integrating hybrid CNN and transformer decoders facilitates detailed recovery while preserving global structures, thus minimizing errors in regions with blurred edges. Additionally, we incorporate a hybrid attention mechanism at the model’s bottleneck to enhance feature transfer between the encoder and decoder. The model was trained using the ACDC, Synapse, and polyp datasets, with a focus on improving segmentation accuracy in regions with blurry edges. Experimental results reveal that the proposed model surpasses existing state-of-the-art methods on the ACDC, Synapse, and polyp datasets, demonstrating its superior performance and effectiveness. These results suggest that the proposed model offers a significant improvement in handling edge blurring, with potential applications in enhancing medical image analysis and diagnostics. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Attention mechanism Convolutional neural network Edge information Medical image segmentation Transformer

来源：评论

学校读者我要写书评

暂无评论

Nonlocal Gravity, Dark Energy and Conformal Symmetry: Testing the Hierarchies of Anomaly-Induced Actions 23

Nonlocal Gravity, Dark Energy and Conformal Symmetry: Testin...

引用

Corfu Summer Institute "23rd Hellenic School and Workshops on Elementary Particle Physics and Gravity", CORFU 2023

作者： Corianò, Claudio Lionetti, Stefano Maglio, Matteo Maria Tommasi, Riccardo Dipartimento di Matematica e Fisica Università del Salento INFN Sezione di Lecce Via Arnesano Lecce73100 Italy National Center for HPC Big Data and Quantum Computing Italy Lecce73100 Italy

Conformal back-reaction generates cosmological models where the trace anomaly reflects the breaking of Weyl invariance. Analyzing these actions yields a dynamic approach to dark energy through anomaly-induced actions (AIAs), that are variational solutions of the trace anomaly functional constraint. Expanded around Minkowski space, they produce semiclassical correlators subject to hierarchical anomalous Ward identities, tied to conformal symmetry and diffeomorphism invariance. We focus on comparing the hierarchy of a specific 4-point function, particularly the 2-gravitons-2-photons correlator (TTJJ), generated by AIAs, to free field theory realizations of the same correlator. We observe that the free field theory original hierarchy splits into one ordinary and one anomalous hierarchy, both satisfying the conservation Ward identities from diffeomorphism invariance. However, we find that the anomalous hierarchy derived from ordinary AIAs in both the Riegert or Fradkin-Vilkovisky gauges, are either affected by double poles or violate the hierarchy of the trace Ward identity, respectively. We show that correct forms of the anomalous hierarchies of 4-point functions (for the TTTT and TTJJ), identified in a perturbative free field theory expansion around flat space, are characterised by anomaly poles, corresponding to a curvature expansion in R−1, together with Weyl invariant terms. We derive the effective action that generates the correct form of the hierarchy for the TTJJ. © Copyright owned by the author(s) under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND 4.0).

关键词： Correlators

来源：评论

学校读者我要写书评

暂无评论

STB-GraCapsNet: A Novel Capsule Network Structure with Swin Transformer Block 25th

STB-GraCapsNet: A Novel Capsule Network Structure with Swin...

引用

25th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2024

作者： Zhang, Chunying Dong, Ziao Wang, Liya Liu, Lu Ren, Jing Ma, Jiang Liu, Bin College of Science North China University of Science and Technology 21 Bohai Road Caofeidian Xincheng Hebei Tangshan063210 China Big data and Social Computing Research Center Hebei University of Science and Technology Hebei Shijiazhuang0500198 China

ISBN: (纸本)9789819642069

Capsule network is a new type of neural network encoding features into capsules and constructing the part-whole relationships, which demonstrated good performance in image classification. However, it has some issues such as weak feature extraction ability and large number of training parameters, leading to performance decline when processing images with complex background. To address these issues, this article proposes a novel capsule network structure called STB-GraCapsNet, with key improvements as follows: 1) It uses Swin Transformer Block with the shift window attention mechanism for data preprocessing to obtain richer features;2) the features are then processed through Linear Embedding and passed into the Primary Capsule Layer to generate high-dimension feature capsules, which reduces primary capsules number and improves feature extraction ability of the network. Ablation and comparative experiments based on multiple datasets show that STB-GraCapsNet performs better on complex datasets: 77.8% and 36.2% reduction in parameters number of capsule structure, and 12.07% and 5.22% improvement in model accuracy, as compared to CapsNet and GraCapsNet, respectively. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

SharDAG: Scaling DAG-Based Blockchains Via Adaptive Sharding 40

SharDAG: Scaling DAG-Based Blockchains Via Adaptive Sharding

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Cheng, Feng Xiao, Jiang Liu, Cunyang Zhang, Shijie Zhou, Yifan Li, Bo Li, Baochun Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab China Hong Kong University of Science and Technology Hong Kong University of Toronto Canada

ISBN: (纸本)9798350317152

Directed Acyclic Graph (DAG)-based blockchain (a.k.a distributed ledger) has become prevalent for supporting highly concurrent applications. Its inherent parallel data structure accelerates block generation significantly, shifting the bottleneck from performance to storage scalability. An intuitive solution is to apply state sharding that divides the entire ledger (i.e., transactions and states) into multiple shards. While each node only stores proportional transactions, it suffers from the challenges of storing and ensuring the processing consistency of cross-shard transactions. In this paper, we propose SharDAG, a new mechanism that leverages adaptive sharding for DAG-based blockchains to achieve high performance and strong consistency. The key idea of SharDAG is to exploit unique characteristics -silent assets -and design a lightweight processing mechanism based on avatar account caching. Furthermore, we design a Byzantine resilient cross-shard verification mechanism with a theoretically optimal number of participating nodes, which guarantees the consistency and security of avatar account aggregation. Our comprehensive evaluations on real-world workloads demonstrate that SharDAG presents up to 3.8 x throughput improvement compared to the state-of-the-art and reduces the storage overhead of cross-shard transactions. © 2024 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

MMH-FE:AMulti-Precision and Multi-Sourced Heterogeneous Privacy-Preserving Neural Network Training Based on Functional Encryption

引用

Computers, Materials & Continua 2025年第3期82卷 5387-5405页

作者： Hao Li Kuan Shao Xin Wang Mufeng Wang Zhenyong Zhang The State Key Laboratory of Public Big Data College of Computer Science and TechnologyGuizhou UniversityGuiyang550025China Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan250014China China Industrial Control Systems Cyber Emergency Response Team Beijing100040China

Due to the development of cloud computing and machine learning,users can upload their data to the cloud for machine learning model ***,dishonest clouds may infer user data,resulting in user data *** schemes have achieved secure outsourced computing,but they suffer from low computational accuracy,difficult-to-handle heterogeneous distribution of data from multiple sources,and high computational cost,which result in extremely poor user experience and expensive cloud computing *** address the above problems,we propose amulti-precision,multi-sourced,andmulti-key outsourcing neural network training ***,we design a multi-precision functional encryption computation based on Euclidean ***,we design the outsourcing model training algorithm based on a multi-precision functional encryption with multi-sourced ***,we conduct experiments on three *** results indicate that our framework achieves an accuracy improvement of 6%to 30%.Additionally,it offers a memory space optimization of 1.0×2^(24) times compared to the previous best approach.

关键词： Functional encryption multi-sourced heterogeneous data privacy preservation neural networks

来源：评论

学校读者我要写书评

暂无评论

Tensor Graph Convolutional Network for Dynamic Graph Representation Learning 7

Tensor Graph Convolutional Network for Dynamic Graph Represe...

引用

7th International Symposium on Autonomous Systems, ISAS 2024

作者： Wang, Ling Yuan, Ye The School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China The Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application For Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China College of Computer and Information Science Southwest University Chongqing400715 China

ISBN: (纸本)9798350363173

Dynamic graphs (DG) represent evolving interactions between entities in various real-world scenarios. Many existing DG representation learning models employ a combination of graph convolutional networks and sequence neural networks to capture spatial-temporal dependencies. However, this hybrid approach often fails to effectively capture the spatial-temporal continuity inherent in DGs. In this paper, we propose a novel approach called the Tensor Graph Convolutional Network (TGCN) to learn DG representations within a unified convolution framework based on tensor products. Our approach is founded on two key principles: (a) representing DG information in tensor form, and (b) leveraging tensor product operations to design a graph convolutional network that simultaneously models spatial and temporal features. Experimental results on three real-world DG datasets demonstrate that our proposed model achieves state-of-the-art performance. © 2024 IEEE.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

RETIA: Relation-Entity Twin-Interact Aggregation for Temporal Knowledge Graph Extrapolation 39

RETIA: Relation-Entity Twin-Interact Aggregation for Tempora...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

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

ISBN: (纸本)9798350322279

Temporal knowledge graph (TKG) extrapolation aims to predict future unknown events (facts) based on historical information, and has attracted considerable attention due to its great practical significance. Accurate representations (embeddings) of entities and relations form the basis of TKG extrapolation. Recent work has been devoted to improving the rationality of entity representations. However, on the one hand, ignoring relation modeling results in incomplete relation representations;therefore, some approaches aggregate only immediately adjacent entities of relations, but this can lead to the "message islands"problem of relation modeling. On the other hand, ignoring the association constraints between relations and entities can make the embeddings of both relations and entities prone to overfitting. To address the abovementioned challenges, we propose an advanced method, namely, RETIA. For the former issue, we generate twin hyperrelation subgraphs for each historical subgraph and then aggregate both the adjacent entities and relations in the hyperrelation subgraphs through a graph convolutional network (GCN). About the latter concern, we propose a twin-interact module (TIM), which provides communication channels for relation aggregation and entity aggregation during the evolution of the historical sequence. Experiments conducted on five public datasets show that RETIA has made great improvements across several evaluation metrics. Our released code is available at https://***/CGCL-codes/RETIA. © 2023 IEEE.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

Seer: Accelerating Block chain Transaction Execution by Fine-Grained Branch Prediction 51st

Seer: Accelerating Block chain Transaction Execution by Fine...

引用

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Ultimate Negative Sampling for Contrastive Learning

Ultimate Negative Sampling for Contrastive Learning

引用

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

作者： Huijie Guo Lei Shi Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Unsupervised learning has received more attention due to the superior performance of contrastive learning methods. Most contrastive methods use data augmentation techniques to construct positive and negative pairs. The augmented view of the same sample is regarded as a positive sample, while the rest are negative samples. This negative sampling strategy has strong randomness and ignores samples that are semantically similar to anchors, namely sampling bias. This problem has been addressed by weighting the similarity of negative samples. In this paper, we propose a novel ultimate negative sampling for contrastive learning. Unlike random sampling, we set a more extreme negative sample selection mechanism based on the ideal representation of the sample. Furthermore, we constrain the consistency between samples across the space. Experiment results demonstrate the proposed method’s superiority on multiple benchmark datasets.

关键词： Benchmark testing Signal processing Acoustics Speech processing Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：