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

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Cheng, Haibo Liu, Wenjian Qu, Youyang Fu, Kexue Wang, Qinyuan City University of Macau Faculty of Data Science China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China

ISBN: (纸本)9798350391367

Federated learning (FL) is a distributed learning method that reduces data transmission and privacy risks. However, the existence of a central server may become a target of attackers, resulting in an increased risk of user privacy leakage. The emergence of Decentralized Federated Learning (DFL) is posited to enhance data privacy and system reliability by reducing reliance on central servers and enhancing local data control, especially in the medical field, where personal health data is protected. This research investigates the application of (DFL) in the medical domain, focusing on its limitations. This study employs a systematic literature review, adhering to PRISMA guidelines, to comprehensively understand DFL's current landscape and challenges in healthcare. The key findings highlight four principal obstacles faced by DFL: security and privacy, communication efficiency, data and model heterogeneity, and incentive mechanisms. It also explores the potential for DFL to facilitate personalized healthcare treatments by large datasets distributed across various medical institutions. This research fills a significant void by systematically reviewing DFL technologies in healthcare. It provides insights into applications, challenges, and future directions for participants seeking secure and efficient healthcare data handling. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Object Segmentation-Assisted Inter Prediction for Versatile Video Coding

arXiv

引用

arXiv 2024年

作者： Li, Zhuoyuan Yuan, Zikun Li, Li Liu, Dong Tang, Xiaohu Wu, Feng CAS Key Laboratory of Technology in Geo-Spatial Information Processing and Application System University of Science and Technology of China Hefei230027 China Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu610031 China

In modern video coding standards, block-based inter prediction is widely adopted, which brings high compression efficiency. However, in natural videos, there are usually multiple moving objects of arbitrary shapes, resulting in complex motion fields that are difficult to represent compactly. This problem has been tackled by more flexible block partitioning methods in the Versatile Video Coding (VVC) standard, but the more flexible partitions require more overhead bits to signal and still cannot be made arbitrarily shaped. To address this limitation, we propose an object segmentation-assisted inter prediction method (SAIP), where objects in the reference frames are segmented by some advanced technologies. With a proper indication, the object segmentation mask is translated from the reference frame to the current frame as the arbitrary-shaped partition of different regions without any extra signal. Using the segmentation mask, motion compensation is separately performed for different regions, achieving higher prediction accuracy. The segmentation mask is further used to code the motion vectors of different regions more efficiently. Moreover, the segmentation mask is considered in the joint rate-distortion optimization for motion estimation and partition estimation to derive the motion vector of different regions and partition more accurately. The proposed method is implemented into the VVC reference software, VTM version 12.0. Experimental results show that the proposed method achieves up to 1.98%, 1.14%, 0.79%, and on average 0.82%, 0.49%, 0.37% BD-rate reduction for common test sequences, under the Low-delay P, Low-delay B, and Random Access configurations, respectively. Copyright © 2024, The Authors. All rights reserved.

关键词： Video signal processing

来源：评论

学校读者我要写书评

暂无评论

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algorithm on the New Sunway Supercomputer 29

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algori...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Tian, Min Liu, Qi Li, Yanlong Du, Wei Ren, Zenghui Liu, Yue Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks China Jinan Institute of Supercomputing Technology Jinan Key Laboratory of High Performance Computing China

ISBN: (纸本)9798350330717

The solution of tridiagonal linear systems is used in in various fields and plays a crucial role in numerical simulations. However, there is few efficient solver for tridiagonal linear systems on the new Sunway supercomputer. Based on a three-dimensional heat conduction problem, we propose an adaptive heterogeneous tridiagonal matrix algorithm (AH-TDMA). Our major innovations include: (1) To address computational hotspots within AH-TDMA, a multi-level parallel approach involving MPI+Athread has been adopted. (2) An adaptive data partitioning scheme has been set up to achieve load balance. (3) Employing direct memory access and establishing shared space between registers and main memory, instead of employing discrete memory access, is done to enhance memory access efficiency. (4) The optimization of the loop structure has been made in adjusting the sequencing of the dual-layered loops to reduce communication overhead. The experimental results show that, with one core group, the AH-TDMA achieves a speedup of 99.6 times for hotspot and total time speedup up to 59.4 times compared to the Parallel and Scalable Library for Tridiagonal Matrix Algorithm (PaScal TDMA). The AH-TDMA is scalable up to 2048 core groups, with a parallel efficiency of 69.2%. © 2023 IEEE.

关键词： adaptive heterogeneous algorithm MPI+Athread Sunway supercomputer three-dimensional heat conduction problem tridiagonal linear systems

来源：评论

学校读者我要写书评

暂无评论

Joint Alignment of Multi-Task Feature and Label Spaces for Emotion Cause Pair Extraction 29

Joint Alignment of Multi-Task Feature and Label Spaces for E...

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Chen, Shunjie Shi, Xiaochuan Li, Jingye Wu, Shengqiong Fei, Hao Li, Fei Ji, Donghong Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan China School of Computing National University of Singapore Singapore Singapore

Emotion cause pair extraction (ECPE), as one of the derived subtasks of emotion cause analysis (ECA), shares rich inter-related features with emotion extraction (EE) and cause extraction (CE). Therefore EE and CE are frequently utilized as auxiliary tasks for better feature learning, modeled via multi-task learning (MTL) framework by prior works to achieve state-of-the-art (SoTA) ECPE results. However, existing MTL-based methods either fail to simultaneously model the specific features and the interactive feature in between, or suffer from the inconsistency of label prediction. In this work, we consider addressing the above challenges for improving ECPE by performing two alignment mechanisms with a novel A2Net model. We first propose a feature-task alignment to explicitly model the specific emotion-&cause-specific features and the shared interactive feature. Besides, an inter-task alignment is implemented, in which the label distance between the ECPE and the combinations of EE&CE are learned to be narrowed for better label consistency. Evaluations of benchmarks show that our methods outperform current best-performing systems on all ECA subtasks. Further analysis proves the importance of our proposed alignment mechanisms for the task. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

hcaPCG: A Heterogeneous and communication-avoid PCG with Jacobi preconditioner on SW26010-Pro architecture 29

hcaPCG: A Heterogeneous and communication-avoid PCG with Jac...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Tian, Min Liu, Yue Wang, Li Chen, Yanyan Liu, Qi Pan, Jingshan Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks China Jinan Institute of Supercomputing Technology Jinan Key Laboratory of High Performance Computing China

ISBN: (纸本)9798350330717

Due to its efficiency and versatility, the preconditioned conjugate gradient algorithm has long been a staple in the realm of iterative linear system solvers. In this paper, we proposed an optimized preconditioned conjugate gradient algorithm tailored for the SW26010-Pro manycore processor, The main work includes: Optimizing data block sizes based on the processor's storage structure;combining thread-level and data-level parallelism, utilizing manual SIMD to improve efficiency;optimizing the memory access pattern by employing direct memory access and overlapping of computation and communication;employing a shared-memory approach to store long vectors across all cores. Furthermore, we design an accelerated algorithm for reduction operations, to avoid data communication. Experimental results show that the hcaPCG yields up to 28.1× speedups on average compared to the original implementation. © 2023 IEEE.

关键词： Communication-avoid Heterogeneous System Jacobi preconditioner PCG algorithm SW26010-Pro

来源：评论

学校读者我要写书评

暂无评论

Text information Mining in Cyberspace: An information Extraction Method Based on T5 and keyBERT 9

Text Information Mining in Cyberspace: An Information Extrac...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Liu, Kuan Li, Yumei Qi, Yuanhua Qi, Ning Zhai, Mengran Qilu University of Technology Shandong Academy of Sciences Information Research Institute Shandong Academy of Sciences Jinan China Qilu University of Technology Shandong Academy of Sciences Shandong Institute of Economy and Informatization Development Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Qilu University of Technology Shandong Academy of Sciences Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China SHANDONG SCICOM Information and Economy Research Institute Co. Ltd Jinan China Shandong Institute of Economy and Informatization Development Jinan China

ISBN: (纸本)9798350391367

With the development of the digital economy and the advent of the big data era, the rapid growth of textual information in cyberspace has placed higher demands on information processing technology. This paper proposes an information extraction technique based on the Text-to-Text Transfer Transformer, known as T5, and keyBERT models, aiming to efficiently distill the key content from textual information in cyberspace. This method combines automatic summarization and keyword extraction to form information briefs. The experiments selected representative policy documents related to data elements as input data and employed information entropy and ROUGE scores as metrics to evaluate the automatic summarization model. The results were compared with the outputs of similar models. Experimental results indicate that the T5 model outperforms other models in terms of summarization effectiveness, and the proposed information extraction method shows significant advantages in readability and processing efficiency, demonstrating practical application value. © 2024 IEEE.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for MEC in Ultra-dense Networks

引用

Journal of Computers (Taiwan) 2025年第1期36卷 143-162页

作者： Ma, Huan Li, Shuyun Wang, Zhihui Dou, Xubing Zhang, Xinchang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China Shandong Normal University Jinan China

In the complex context of 5G ultra-dense networks, the unprecedented growth in traffic and computing demand has made the interaction between edge devices and edge servers extremely intricate due to the time-varying nature of the network environment and resource heterogeneity. The combination of UDN and Mobile Edge computing not only significantly improves network performance but also expands application scenarios and enhances user experience, marking it as one of the crucial trends in future network development. In this paper, we review recent results and research progress on MEC-based resource allocation in 5G ultra-dense networks. We analyze resource allocation strategies from multiple dimensions, including user association, interference management, energy efficiency optimization, delay reduction, access selection, and user mobility. Finally, we discuss the challenges and open issues that need to be addressed for future development in this area. © 2025 Codon Publications. All rights reserved.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

A barotropic solver capable of reducing global synchronization latency in parallel ocean program

引用

CCF Transactions on High Performance computing 2025年 1-16页

作者： Fan, Xiaoyong Zhuang, Yuan Zeng, Yunhui Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China

High-resolution community earth system model (CESM) plays a crucial role in studying climate complexity and predicting future climate change trends. In the parallel ocean program (POP) component of CESM, the communication overhead of the preconditioned conjugate gradient (PCG) method used in the barotropic mode is the main bottleneck affecting POP2 performance. In the high-resolution (0.1 $$^{\circ }$$ ) PCG barotropic solver simulation experiments, as the number of processors increases, the proportion of time spent on global reduction operations gradually increases. To address this issue, we have significantly improved two new barotropic solvers: the preconditioned pipelined conjugate gradient (PIPEPCG) and the preconditioned pipelined conjugate residual (PIPEPCR). The PIPEPCG and PIPEPCR algorithms are based on the PCG algorithm and utilize pipeline technology to reorder the algorithmic process, thereby creating conditions for implementing optimizations such as merging inner product operations and overlapping communication with computation. In these algorithms, we perform inner product merging to execute only one global reduction operation per iteration. Additionally, we replaced the original blocking global reduction functions with non-blocking global reduction, allowing these operations to overlap with matrix–vector multiplication, boundary update operations, and preconditioning operations. We also optimized the position of boundary updates and employed techniques such as residual replacement operations and vector merging to further enhance algorithm performance. Additionally, we replaced the original diagonal preconditioner with an EVP (error vector propagation) preconditioner, which further improved the parallel performance of the algorithm. Our experimental results show that in high-resolution POP2 simulations using 10,000 processors, the new PIPEPCG and PIPEPCR solvers achieved speedup ratios of approximately 1.98x and 1.89x, respectively, compared to the cl

关键词： Pipeline laying

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：