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

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

来源：评论

学校读者我要写书评

暂无评论

An Elite Archive-Assisted Multi-Objective Evolutionary Algorithm for mRNA Design 13

An Elite Archive-Assisted Multi-Objective Evolutionary Algor...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Hong, Wenjing Chen, Cheng Zhu, Zexuan Tang, Ke Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Southern University of Science and Technology Department of Computer Science and Engineering Shenzhen China

ISBN: (纸本)9798350308365

Messenger RNA (mRNA) vaccines have emerged as highly effective strategies in the prophylaxis and treatment of diseases. mRNA design, a key to the success of mRNA vaccines, in-volves finding optimal codons and increasing secondary structure stability to lengthen mRNA half-life, ultimately enhancing protein expression. Despite receiving widespread attention, most methods primarily rely on manual design, which is time-consuming and labor-intensive. While optimization approaches can alleviate this issue, existing methods still exhibit critical limitations caused by conflicts between codon usage and mRNA structural stability, compounded by the vast design space of mRNA resulting from the presence of synonymous codons. In this paper, a novel multi-objective evolutionary optimization-based mRNA design method is proposed. We first formulate the mRNA design problem as a multi-objective optimization problem and then develop an Elite Archive-Assisted Multi-Objective Evolutionary algorithm for mRNA Design, namely EAA-MOED, by incorporating a novel elite archive-assisted method into a weighted optimization framework to improve search efficiency. Experimental studies, involving two state-of-the-art mRNA design methods and five well-known MOEAs, show the competitiveness of the proposed EAA-MOED in mRNA design. © 2024 IEEE.

关键词： Vaccines

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: Fooling Segment Anything Model to Segment Nothing 38

DarkSAM: Fooling Segment Anything Model to Segment Nothing

引用

38th Conference on Neural Information Processing systems, NeurIPS 2024

作者： Zhou, Ziqi Song, Yufei Li, Minghui Hu, Shengshan Wang, Xianlong Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

JGC-IAGCL: Fusing joint graph convolution and intent-aware graph contrastive learning for explainable recommendation

引用

Information Fusion 2025年 123卷

作者： Yang, Zhi Lin, Chuan Qin, Yongbin Huang, Ruizhang Chen, Yanping Qin, Jiwei State Key Laboratory of Public Big Data Guizhou University Guiyang Guizhou550025 China Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University Guiyang Guizhou550025 China College of Information Science and Engineering Xinjiang University Xinjiang Uygur Autonomous Region Urumqi830046 China

Graph contrastive learning (GCL) enhances recommendation accuracy by leveraging self-supervised features to refine node representations from large-scale unlabeled data. Traditional GCL-based recommendation models typically construct contrastive views via graph augmentation (e.g., stochastic node/edge dropout) or embedding-space perturbation, aiming to maximize representation consistency. However, these methods struggle to effectively model and interpret user preferences and consumption intents, limiting explainability and recommendation performance. To address these challenges, we propose JGC-IAGCL (Joint Graph Convolution and Intent-Aware Graph Contrastive Learning), an explainable recommendation framework. JGC-IAGCL integrates joint graph convolution to capture implicit user preferences and employs intent-aware graph contrastive learning to extract explicit user intents from user–item interactions. By fusing these features, our method generates evenly distributed, intent-propensity-aware user/item representations. Theoretical analysis shows that JGC-IAGCL mitigates popularity bias while enhancing the exposure of long-tail items. Extensive experiments on four highly sparse public datasets validate its effectiveness, demonstrating superior recommendation accuracy and improved interpretability. © 2025

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

LSGraph: A Locality-centric High-performance Streaming Graph Engine 24

LSGraph: A Locality-centric High-performance Streaming Graph...

引用

19th European Conference on Computer systems, EuroSys 2024

作者： Qi, Hao Wu, Yiyang He, Ligang Zhang, Yu Luo, Kang Cai, Minzhi Jin, Hai Zhang, Zhan Zhao, 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 Computer Science University of Warwick United Kingdom Zhejiang Lab China

ISBN: (纸本)9798400704376

Streaming graph has been broadly employed across various application domains. It involves updating edges to the graph and then performing analytics on the updated graph. However, existing solutions either suffer from poor data locality and high computation complexity for streaming graph analytics, or need high overhead to search and move graph data to ensure ordered neighbors during streaming graph update. This paper presents a novel locality-centric streaming graph engine, called LSGraph, to enable efficient both graph analytics and graph update. The main novelty of this engine is a differentiated hierarchical indexed streaming graph representation approach to achieve efficient data search and movement for graph update and also maintain data locality and ordered neighbors for efficient graph analytics simultaneously. Besides, a locality-aware streaming graph data update mechanism is also proposed to efficiently regulate the distance of data movement, minimizing the overhead of memory access during graph update. We have implemented LSGraph and conducted a systematic evaluation on both real-world and synthetic datasets. Compared with three cutting-edge streaming graph engines, i.e., Terrace, Aspen, and PaC-tree, LSGraph achieves 2.98×-81.08×, 1.46×-12.56×, and 1.26×-10.31× speedups during graph update, while obtaining 1.02×-4.28×, 1.58×-3.55×, and 1.20×-2.72× speedups during graph analytics, respectively. © 2024 Owner/Author.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Effcient Distributed Skyline Queries for Mobile Applications

引用

Journal of Computer Science & technology 2010年第3期25卷 523-536页

作者：肖迎元陈跃国 Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Key Laboratory of Computer Vision and System Tianjin University of Technology School of Computing National University of Singapore Key Laboratory of Data Engineering and Knowledge Engineering Renmin University of China

In this paper, we consider skyline queries in a mobile and distributed environment, where data objects are distributed in some sites （database servers） which are interconnected through a high-speed wired network, and queries are issued by mobile units （laptop, cell phone, etc.） which access the data objects of database servers by wireless channels. The inherent properties of mobile computing environment such as mobility, limited wireless bandwidth, frequent disconnection, make skyline queries more complicated. We show how to efficiently perform distributed skyline queries in a mobile environment and propose a skyline query processing approach, called efficient distributed skyline based on mobile computing （EDS-MC）. In EDS-MC, a distributed skyline query is decomposed into five processing phases and each phase is elaborately designed in order to reduce the network communication, network delay and query response time. We conduct extensive experiments in a simulated mobile database system, and the experimental results demonstrate the superiority of EDS-MC over other skyline query processing techniques on mobile computing.

关键词： skyline distributed query processing mobile database system

来源：评论

学校读者我要写书评

暂无评论

N-Docker: A NVM-HDD Hybrid Docker Storage Framework to Improve Docker Performance 16th

N-Docker: A NVM-HDD Hybrid Docker Storage Framework to Impro...

引用

16th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2019

作者： Gu, Lin Tang, Qizhi Wu, Song Jin, Hai Zhang, Yingxi Shi, Guoqiang Lin, Tingyu Rao, Jia 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 State Key Laboratory of Intelligent Manufacturing System Technology Beijing100854 China The University of Texas at Arlington ArlingtonTX76019 United States

ISBN: (纸本)9783030307080

Docker has been widely adopted in production environment, but unfortunately deployment and cold-start of container are limited by the low speed of disk. The emerging non-volatile memory (NVM) technology, which has high speed and can store data permanently, brings a new chance to accelerate the deployment and cold-start of container. However, it is expensive to replace the whole hard disk driver (HDD) with NVM. To achieve the fastest deployment and cold-start with lowest cost, we conduct in-depth analysis on the Top-134 images in Docker Hub and obtain two main insights as: (1) the storing latency of layered image has become the bottleneck of container deployment;(2) only a few image layers are required for container cold-start. Based on these two findings, we propose a NVM-HDD hybrid docker storage framework as N-Docker. It can effectively accelerate container cold-start by detecting the bottleneck layers as well as cold-start required layers and storing them into NVM for faster container startup with limited NVM capacity. Experimental results show that N-Docker can accelerate the container deployment by 1.21X and cold-start by 2.96X. Compared to NVM-Docker, which stores all images into NVM, N-Docker achieves the same performance improvements while reducing the usage of NVM by 88.22%. © 2019, IFIP International Federation for Information Processing.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

Collaborative wi-fi fingerprinting indoor positioning using near relation 24

Collaborative wi-fi fingerprinting indoor positioning using ...

引用

2020 24th ISPRS Congress - Technical Commission IV on Spatial Information Science

作者： Wang, Y. Wang, W. Li, X. Zhang, W. Guo, R. National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Urban Informatics Shenzhen Key Laboratory of Spatial Smart Sensing and Services Research Institute for Smart Cities School of Architecture and Urban Planning Shenzhen University Shenzhen China

Indoor positioning is of great importance to the era of mobile computing. Currently, much attention has been paid to RSS-based location for that it can provide position information without additional equipment. However, this method suffers from many challenges: (1) fingerprint ambiguity;(2) labor-intensive of fingerprint collection;(3) low efficiency of fingerprint matching. To get over these drawbacks, we provide a collaborative WiFi fingerprinting indoor positioning method using near relation. The base idea of this method is that interpolation method is used to enrich sparse Wi-Fi fingerprint. Near relation boundary is provided and Wi-Fi fingerprints is constrained to this region to reduce fingerprint ambiguity, which also can improve the efficiency of fingerprint matching. Extensive experiments show that a positioning accuracy of 3.8m can be achieved with the near relation under 1m interpolation density. © 2020 Authors.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Efficient Hardware Redo Logging for Secure Persistent Memory 23

Efficient Hardware Redo Logging for Secure Persistent Memory

引用

23rd IEEE International Conference on High Performance computing and Communications, 7th IEEE International Conference on data Science and systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and big data systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Zhang, Zhan Yue, Jianhui Liao, Xiaofei 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 Wuhan China Michigan Technological University Computer Science Department HoughtonMI United States

ISBN: (纸本)9781665494571

Write-ahead log and data encryption technologies are employed to ensure both crash consistency and data security for persistent memory (PM). The encryption/decryption of both data and log requests increase the memory request latency, degrading the system performance. To tackle this issue, this paper proposes a novel log-aware memory encryption scheme to reduce encryption/decryption operations, without compromising data security. Specifically, redo log blocks are stored as ciphertext for their corresponding data blocks to avoid encryption/decryption of log data blocks when in-place update operations are applied to them. We further design a compact log record layout with fewer encryption metadata in log records to reduce logging traffic. Our simulation results show that the transaction throughput of the proposed design outperforms the baseline design and the state-of-the-art design by 87.3% and 55.3% on average, respectively. © 2021 IEEE.

关键词： Smart cities system performance Simulation Memory management Layout Memory architecture Metadata

来源：评论

学校读者我要写书评

暂无评论

IGED:Towards Intelligent DDoS Detection Model Using Improved Generalized Entropy and DNN

引用

Computers, Materials & Continua 2024年第8期80卷 1851-1866页

作者： Yanhua Liu Yuting Han HuiChen Baokang Zhao XiaofengWang Ximeng Liu College of Computer and Data Science Fuzhou UniversityFuzhou350108China Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou350108China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350108China College of Computer National University of Defense TechnologyChangsha410073China

As the scale of the networks continually expands,the detection of distributed denial of service(DDoS)attacks has become increasingly *** propose an intelligent detection model named IGED by using improved generalized entropy and deep neural network(DNN).The initial detection is based on improved generalized entropy to filter out as much normal traffic as possible,thereby reducing data *** the fine detection is based on DNN to perform precise DDoS detection on the filtered suspicious traffic,enhancing the neural network’s generalization *** results show that the proposed method can efficiently distinguish normal traffic from DDoS *** with the benchmark methods,our method reaches 99.9%on low-rate DDoS(LDDoS),flooded DDoS and CICDDoS2019 datasets in terms of both accuracy and efficiency in identifying attack flows while reducing the time by 17%,31%and 8%.

关键词： DDoS real-time improved generalized entropy DNN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：