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

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

来源：评论

学校读者我要写书评

暂无评论

A Secure Synchronized Reading System over Time-Critical Online Contests

A Secure Synchronized Reading System over Time-Critical Onli...

引用

IEEE International Conference on Communications

作者： Wei Wang Peng Xu Hui Li Laurence Tianruo Yang Key Lab of Cloud Computing Technology Peking University Shenzhen China Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Embedded and Pervasive Computing Lab Huazhong University of Science and Technology Wuhan China

The time-critical online contest environment calls for an elegant and precise management system to start a contest online. The management system should simultaneously follow three rules of security that are confidentiality, anonymity and fairness. We present in this paper a novel system named Secure Synchronized Reading (SSR) system as well as its corresponding security model according to the three rules. SSR can evoke a synchronized start for all competitors in a contest at the intended time by employing a Randomness-reused Identity-Based Encryption (RIBE) scheme. It can avoid huge differences among delivery delays of heterogeneous competitors and any false start by an adverse competitor. Consequently when an online contest begins, the SSR system performs quasi real-time with ignorable communication delays in the security model. As a complement, the analysis on the provable security of SSR is given finally, as well as a further analysis on the achievement of synchronization.

关键词： Synchronization Encryption Delays Real-time systems Identity-based encryption

来源：评论

学校读者我要写书评

暂无评论

FlexiFed: Personalized Federated Learning for Edge Clients with Heterogeneous Model Architectures 23

FlexiFed: Personalized Federated Learning for Edge Clients w...

引用

2023 World Wide Web Conference, WWW 2023

作者： Wang, Kaibin He, Qiang Chen, Feifei Chen, Chunyang Huang, Faliang Jin, Hai Yang, Yun School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computing Technologies Swinburne University of Technology Australia School of Information Technology Deakin University Australia Faculty of Information Technology Monash University Australia Guangxi Key Lab of Human-machine Interaction and Intelligent Decision Nanning Normal University China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9781450394161

Mobile and Web-of-Things (WoT) devices at the network edge account for more than half of the world's web traffic, making a great data source for various machine learning (ML) applications, particularly federated learning (FL) which offers a promising solution to privacy-preserving ML feeding on these data. FL allows edge mobile and WoT devices to train a shared global ML model under the orchestration of a central parameter server. In the real world, due to resource heterogeneity, these edge devices often train different versions of models (e.g., VGG-16 and VGG-19) or different ML models (e.g., VGG and ResNet) for the same ML task (e.g., computer vision and speech recognition). Existing FL schemes have assumed that participating edge devices share a common model architecture, and thus cannot facilitate FL across edge devices with heterogeneous ML model architectures. We explored this architecture heterogeneity challenge and found that FL can and should accommodate these edge devices to improve model accuracy and accelerate model training. This paper presents our findings and FlexiFed, a novel scheme for FL across edge devices with heterogeneous model architectures, and three model aggregation strategies for accommodating architecture heterogeneity under FlexiFed. Experiments with four widely-used ML models on four public datasets demonstrate 1) the usefulness of FlexiFed;and 2) that compared with the state-of-the-art FL scheme, FlexiFed improves model accuracy by 2.6%-9.7% and accelerates model convergence by 1.24 × -4.04 ×. © 2023 ACM.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

GradSA: Gradient Sparsification and Accumulation for Communication-Efficient Distributed Deep Learning 15th

GradSA: Gradient Sparsification and Accumulation for Communi...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Liu, Bo Jiang, Wenbin Zhao, Shaofeng Jin, Hai He, Bingsheng National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System Engineering Research Center of Data Storage Systems and Technology Huazhong University of Science and Technology Wuhan China Library Henan University of Economics and Law Zhengzhou China Department of Computer Science School of Computing National University of Singapore Singapore Singapore

ISBN: (纸本)9783030642426

Large-scale distributed deep learning is of great importance in various applications. For distributed training, the inter-node gradient communication often becomes the performance bottleneck. Gradient sparsification has been proposed to reduce the communication overhead. However, the sparsification only arbitrarily selects a small fraction of gradients, while the efficiency of selection dimension has been overlooked. Furthermore, gradient staleness is inevitable after applying the sparsification which will ultimately lead to model divergence. In this paper, we propose a staleness-compensated sparse stochastic gradient descent algorithm, GradSA, to improve the training efficiency. Layer-level gradients are sparsified to reduce the communication overhead, which conform to the characteristics of the network structure, and historical accumulation of the approximated gradients is utilized to speed up convergence. We demonstrate the model convergence acceleration and the efficiency of our layer-level selection over existing state-of-the-art works, such as DGC, TernGrad, and 8-Bit quantization. © 2020, Springer Nature Switzerland AG.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Towards Effective and Efficient Error Handling Code Fuzzing Based on Software Fault Injection 31

Towards Effective and Efficient Error Handling Code Fuzzing ...

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Chen, Kang Wen, Ming Jia, Haoxiang Wu, Rongxin Jin, Hai Wuhan430074 China Jin YinHu Laboratory Wuhan430074 China School of Informatics Xiamen University Xiamen361005 China School of Computer Science and Technology HUST Wuhan430074 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security China Cluster and Grid Computing Lab China

ISBN: (纸本)9798350330663

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL-F I are effective that contribute significantly to its overall performance. © 2024 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Intersecting-Boundary-Sensitive Fingerprinting for Tampering Detection of DNN Models 41

Intersecting-Boundary-Sensitive Fingerprinting for Tampering...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Bai, Xiaofan He, Chaoxiang Ma, Xiaojing Zhu, Bin Benjamin Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China Microsoft United States School of Computer Science and Technology Huazhong University of Science and Technology China Cluster and Grid Computing Lab China

Cloud-based AI services offer numerous benefits but also introduce vulnerabilities, allowing for tampering with deployed DNN models, ranging from injecting malicious behaviors to reducing computing resources. Fingerprint samples are generated to query models to detect such tampering. In this paper, we present Intersecting-Boundary-Sensitive Fingerprinting (IBSF), a novel method for black-box integrity verification of DNN models using only top-1 labels. Recognizing that tampering with a model alters its decision boundary, IBSF crafts fingerprint samples from normal samples by maximizing the partial Shannon entropy of a selected subset of categories to position the fingerprint samples near decision boundaries where the categories in the subset intersect. These fingerprint samples are almost indistinguishable from their source samples. We theoretically establish and confirm experimentally that these fingerprint samples' expected sensitivity to tampering increases with the cardinality of the subset. Extensive evaluation demonstrates that IBSF surpasses existing state-of-the-art fingerprinting methods, particularly with larger subset cardinality, establishing its state-of-the-art performance in black-box tampering detection using only top-1 labels. The IBSF code is available at: https://***/CGCL-codes/IBSF. Copyright 2024 by the author(s)

关键词： HTTP

来源：评论

学校读者我要写书评

暂无评论

On the Security of Smart Home Systems:A Survey

引用

Journal of Computer Science & Technology 2023年第2期38卷 228-247页

作者：袁斌万俊吴宇晗邹德清金海 School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan 430074China Hubei Key Laboratory of Distributed System Security Huazhong University of Science and Technology Wuhan 430074China Hubei Engineering Research Center on Big Data Security Huazhong University of Science and Technology Wuhan 430074China National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Lab Huazhong University of Science and TechnologyWuhan 430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen 518057China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan 430074China

Among the plethora of IoT(Internet of Things)applications,the smart home is one of the ***,the rapid development of the smart home has also made smart home systems a target for ***,researchers have made many efforts to investigate and enhance the security of smart home *** a more secure smart home ecosystem,we present a detailed literature review on the security of smart home ***,we categorize smart home systems’security issues into the platform,device,and communication *** exploring the research and specific issues in each of these security areas,we summarize the root causes of the security flaws in today's smart home systems,which include the heterogeneity of internal components of the systems,vendors'customization,the lack of clear responsibility boundaries and the absence of standard security ***,to better understand the security of smart home systems and potentially provide better protection for smart home systems,we propose research directions,including automated vulnerability mining,vigorous security checking,and data-driven security analysis.

关键词： IoT(Internet of Things) smart home IoT security smart home security

来源：评论

学校读者我要写书评

暂无评论

Machine Learning is All You Need: A Simple Token-Based Approach for Effective Code Clone Detection 24

Machine Learning is All You Need: A Simple Token-Based Appro...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Feng, Siyue Suo, Wenqi Wu, Yueming Zou, Deqing Liu, Yang Jin, Hai Huazhong University of Science and Technology China Nanyang Technological University Singapore Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Jinyinhu Laboratory Wuhan430074 China School of Cyber Science and Engineering Hust Wuhan430074 China School of Computer Science and Technology Hust Wuhan430074 China

ISBN: (纸本)9798400702174

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used BigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings. © 2024 ACM.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Unlearnable 3D Point Clouds: Class-wise Transformation Is All You Need 38

Unlearnable 3D Point Clouds: Class-wise Transformation Is Al...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wang, Xianlong Li, Minghui Liu, Wei Zhang, Hangtao Hu, Shengshan Zhang, Yechao Zhou, Ziqi 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 Cyber Science and Engineering Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China

Traditional unlearnable strategies have been proposed to prevent unauthorized users from training on the 2D image data. With more 3D point cloud data containing sensitivity information, unauthorized usage of this new type data has also become a serious concern. To address this, we propose the first integral unlearnable framework for 3D point clouds including two processes: (i) we propose an unlearnable data protection scheme, involving a class-wise setting established by a category-adaptive allocation strategy and multi-transformations assigned to samples;(ii) we propose a data restoration scheme that utilizes class-wise inverse matrix transformation, thus enabling authorized-only training for unlearnable data. This restoration process is a practical issue overlooked in most existing unlearnable literature, i.e., even authorized users struggle to gain knowledge from 3D unlearnable data. Both theoretical and empirical results (including 6 datasets, 16 models, and 2 tasks) demonstrate the effectiveness of our proposed unlearnable framework. Our code is available at https://***/CGCL-codes/UnlearnablePC. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SMOG: Accelerating Subgraph Matching on GPUs

SMOG: Accelerating Subgraph Matching on GPUs

引用

IEEE Conference on High Performance Extreme computing (HPEC)

作者： Zhibin Wang Ziheng Meng Xue Li Xi Lin Long Zheng Chen Tian Sheng Zhong State Key Laboratory for Novel Software Technology Nanjing University Alibaba Group“ National Engineering Research Center for Big Data Technology and System/ Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Zhejiang Lab

Subgraph matching is a crucial problem in graph theory with diverse applications in fields, such as bioinformatics, social networks and recommendation systems. Accelerating subgraph matching can be greatly facilitated by GPUs, which offer exceptional parallelism and high memory bandwidth. By leveraging the power of multiple GPU cards, subgraph matching can be scaled to achieve unprecedented levels of performance. In this paper, we propose SMOG, an abbreviation for. Subgraph Matching On Multi-Card GPUs. It is a general, high-performance and scalable sub graph matching system that utilizes multi-card GPUs. To address the issue of duplication resulting from subgraph automorphism, SMOG introduces a two-step approach. Firstly, it analyzes the symmetry within the subgraph. Then, it adaptively adjusts the graph preprocessing and generates subgraph-aware GPU codes tailored to the given subgraph. Furthermore, SMOG leverages multi-level parallelism by designing the specific strategy for each level, enabling it to scale from 1 to 1,024 GPU cards, resulting in an extraordinary $553\times$ speedup. We evaluate SMOG on various subgraph queries and datasets. The experimental results demonstrate that SMOG outperforms the triangle-specific system TRUST with an average speedup of $2.94\times$ . And it performs significantly better than the subgraph matching system RPS by $203.55\times$ and the graph processing system Gunrock by 35, $455.52\times$ on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：