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

The Dataflow Runtime Environment of DFC 1

21st International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2020

作者： Zhang, Jing Li, Jinrong Du, Zheng Shu, Jiwu Luo, Qiuming NHPCC/Guangdong Key Laboratory of Popular HPC College of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (数字)9783030692445

ISBN: (纸本)9783030692438

In this paper, we introduce the DFC dataflow language and its runtime environment. DFC runtime library is in charge of constructing the DAG of the dataflow graph, firing the DFC tasks and the synchronizations between the tasks of successive passes. Basing on an elaborately implemented thread pool and queued Active Data, DFC runtime shows an ideal performance comparing with DSPatch. The experiment of a simple dataflow graph shows that DFC has better performance for the cases that the parallelism beneath the core number, while DSPatch shows a better scalability for the cases of the parallelism exceed the core number. As DFC is still a prototype language, it lacks the ability to construct the DAG dynamically, which leads to low efficiency when coding for a well-structured dataflow graph. © 2021, Springer Nature Switzerland AG.

关键词： Data flow analysis

来源：评论

学校读者我要写书评

暂无评论

EMALG: An Enhanced Mandarin Lombard Grid Corpus with Meaningful Sentences

EMALG: An Enhanced Mandarin Lombard Grid Corpus with Meaning...

引用

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

作者： Baifeng Li Qingmu Liu Yuhong Yang Hongyang Chen Weiping Tu Song Lin National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan China Hubei Key Laboratory of Multimedia and Network Communication Engineering Wuhan China Guangdong OPPO Mobile Telecommunications Corp. China

This study investigates the Lombard effect, where individuals adapt their speech in noisy environments. We introduce an enhanced Mandarin Lombard grid (EMALG) corpus with meaningful sentences, enhancing the Mandarin Lombard grid (MALG) corpus. EMALG features 34 speakers and improves recording setups, addressing challenges faced by MALG with nonsense sentences. Our findings reveal that in Mandarin, meaningful sentences are more effective in enhancing the Lombard effect. Additionally, we uncover that female exhibit a more pronounced Lombard effect than male when uttering meaningful sentences. Moreover, our results reaffirm the consistency in the Lombard effect comparison between English and Mandarin found in previous research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Compiler of DFC: A Source Code Converter that Transform the Dataflow Code to the Multi-threaded C Code 1

引用

21st International Conference on Parallel and Distributed Computing, Applications, and Technologies, PDCAT 2020

作者： Du, Zheng Zhang, Jing Li, Jinrong Du, Haixin Shu, Jiwu Luo, Qiuming Department of Computer Science and Technology Tsinghua University Beijing China NHPCC/Guangdong Key Laboratory of Popular HPC College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9783030692445

ISBN: (纸本)9783030692438

The working principle of DFC compiler is introduced in this article. DFC is a grammatical extension of standard C language, with special DF function which describe the dependence of computing DAG. DFC compiler, dfcc, is used to convert the DFC source codes to standard C codes with the assistance of multi-threaded library. The lexical rules and grammatical rules are used to setup the AST of DFC codes, and then it is converted to the AST of standard C without DF function nodes. The derived AST is printed into a text file, a normal C file, and finally is processed by GCC to obtain the executable file. The experiment gives some demonstration of that converting details, and the memory footprint is studied to show an ideal scalability. © 2021, Springer Nature Switzerland AG.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Snapshot boosting: a fast ensemble framework for deep neural networks

引用

Science China(Information Sciences) 2020年第1期63卷 77-88页

作者： Wentao ZHANG Jiawei JIANG Yingxia SHAO Bin CUI Center for Data Science Peking University National Engineering Laboratory for Big Data Analysis and Applications Department of Computer Science Beijing Key Lab of Intelligent Telecommunications Software and Multimedia School of Computer ScienceBeijing University of Posts and Telecommunications Key Lab of High Confidence Software Technologies Department of Computer SciencePeking University

Boosting has been proven to be effective in improving the generalization of machine learning models in many fields. It is capable of getting high-diversity base learners and getting an accurate ensemble model by combining a sufficient number of weak learners. However, it is rarely used in deep learning due to the high training budget of the neural network. Another method named snapshot ensemble can significantly reduce the training budget, but it is hard to balance the tradeoff between training costs and diversity. Inspired by the ideas of snapshot ensemble and boosting, we propose a method named snapshot boosting. A series of operations are performed to get many base models with high diversity and accuracy, such as the use of the validation set, the boosting-based training framework, and the effective ensemble strategy. Last, we evaluate our method on the computer vision(CV) and the natural language processing(NLP) tasks, and the results show that snapshot boosting can get a more balanced trade-off between training expenses and ensemble accuracy than other well-known ensemble methods.

关键词： ensemble learning deep learning boosting neural network snapshot ensemble

来源：评论

学校读者我要写书评

暂无评论

Partially Hidden Policy Attribute-Based Multi-keyword Searchable Encryption with Verification and Revocation

引用

IEEE Transactions on Mobile Computing 2025年

作者： Chen, Liqing Xu, Shiguo Jin, Chunhua Zhang, Hao Weng, Jian Huaiyin Institute of Technology Faculty of Computer and Software Engineering Jiangsu Huai'an223003 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Fuzhou350117 China Jinan University College of Information Science and Technology Guangdong Guangzhou510632 China

Data security is becoming increasingly critical as outsourced data services flourish. An effective solution for ensuring data confidentiality in the cloud is attribute-based searchable encryption (ABSE). However, most extant ABSE solutions have not been able to simultaneously achieve rich expressive queries, result validation, attribute revocation, and policy hiding, and there are problems such as inflexibility in query methods and access control capabilities, insufficient scalability and practicality, and privacy leakage. In particular, it should be noted that most ABSE schemes fail to promise the privacy security of access policies and are susceptible to offline keyword guessing attack. Hidden policy-ABSE (HP-ABSE) has been proposed to tackle the issue of explicit attribute values in access policies potentially compromising privacy. Nevertheless, in most existing HP-ABSE schemes, an adversary may initiate attribute values guessing attack to speculate on the values of attribute within access strategy. To this end, this paper proposes partially hidden policy attribute-based multi-keyword searchable encryption with verification and revocation (PHP-ABMKSE-VR). PHP-ABMKSE-VR scheme is practical, secure, as well as effective, making it appropriate for real-world scenarios like smart healthcare, as demonstrated by the experimental outcomes and safety analysis. © 2002-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

New Algorithms for Distributed Fair k-Center Clustering: Almost Accurate as Sequential Algorithms 24

New Algorithms for Distributed Fair k-Center Clustering: Alm...

引用

Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems

作者： Xiaoliang Wu Qilong Feng Ziyun Huang Jinhui Xu Jianxin Wang School of Computer Science and Engineering Central South University & Xiangjiang Laboratory Changsha China Department of Computer Science and Software Engineering Penn State Erie The Behrend College Erie PA USA Department of Computer Science and Engineering State University of New York at Buffalo Buffalo NY USA Hunan Provincial Key Lab on Bioinformatics Central South University & Xiangjiang Laboratory Changsha China

ISBN: (纸本)9798400704864

Fair clustering problems have been paid lots of attention recently. In this paper, we study the k-Center problem under the group fairness and data summarization fairness constraints, denoted as Group Fair k-Center (GFkC) and Data Summarization Fair k-Center (DSFkC), respectively, in the massively parallel computational (MPC) distributed model. The previous best results for the above two problems in the MPC model are a 9-approximation with violation 7 (WWW 2022) and a (17+ε)-approximation without fairness violation (ICML 2020), respectively. In this paper, we obtain a (3+ε)-approximation with violation 1 for the GFkC problem in the MPC model, which is almost as accurate as the best known approximation ratio 3 with violation 1 for the sequential algorithm of the GFkC problem. Moreover, for the DSFkC problem in the MPC model, we obtain a (4+ε)-approximation without fairness violation, which is very close to the best known approximation ratio 3 for the sequential algorithm of the DSFkC problem. Empirical experiments show that our distributed algorithms perform better than existing state-of-the-art distributed methods for the above two problems.

关键词： clustering fairness machine learning

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Efficiently Privacy-Preserving Federated Learning Framework Using Shamir Secret Sharing

引用

IEEE Transactions on Consumer Electronics 2024年 1-1页

作者： Fu, Xiya Xiong, Ling Li, Fagen Yang, Xingchun Xiong, Naixue School of Computer and Software Engineering Xihua University Chengdu China University of Electronic Science and Technology of China Chengdu China Intelligent Policing Key Laboratory of Sichuan Province Chengdu China College of Intelligence and Computing Tianjin University Tianjin China

Federated learning, an emerging distributed learning paradigm, offers significant advantages and holds promise for addressing trust issues, breaking down data silos, and enabling active data sharing in the realm of consumer electronics. However, traditional federated learning faces critical security and privacy challenges in this domain, including single-point attacks, inference attacks, and poisoning attacks. To address these pressing security concerns, this paper proposes a decentralized federated learning framework focusing on security, reliability, and efficiency, tailored to meet the sustainability demands of consumer electronics. The proposed framework is founded upon masking and secret sharing techniques, establishing an emphatic privacy-preserving federated learning framework that ensures the security of gradient data and robustness against participant dropouts. Additionally, we actively motivate high-quality participants to collaborate by incorporating an incentive mechanism. Building upon the enhancement of existing federated learning approaches reliant on masking techniques, the method outlined in this paper significantly reduces communication overhead while preserving accuracy. Empirical research results comprehensively substantiate the superiority of this approach. Furthermore, compared to prevalent blockchain-based federated learning methods, our approach makes noteworthy strides in accuracy and efficiency. IEEE

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A Unified Open Adapter for Open-World Noisy Label Learning: Data-Centric and Learning-Based Insights

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Zong, Chen-Chen Yang, Peng-Hui Xie, Ming-Kun Huang, Sheng-Jun Nanjing University of Aeronautics and Astronautics MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Collaborative Innovation Center of Novel Software Technology and Industrialization College of Computer Science and Technology Nanjing211106 China Nanyang Technological University School of Computer Science and Engineering 639798 Singapore Tokyo103-0027 Japan

Noisy label learning (NLL) in open-world scenarios poses a novel challenge due to the presence of noisy data from both known and unknown classes. Most existing methods operate under the closed-set assumption, rendering them vulnerable to open-set noise, which significantly degrades their performance. While some approaches attempt to mitigate the impact of open-set examples, they struggle to learn effective discriminative representations for them, leading to unsatisfactory recognition performance. To address these issues, we propose a unified Open Adapter (OpenAda) that identifies open-set noise from both data-centric and learning-based perspectives, and can be easily integrated into mainstream NLL methods to improve their performance and robustness. Specifically, the data-centric part leverages label clusterability to sequentially identify basic clean and basic open-set examples both with high neighbor agreement. The learning-based part integrates one-vs-all classifiers with a progressive open disambiguation strategy to learn a reliable "inlier vs. outlier" boundary for each class. This enables the model to detect challenging open-set examples that partially overlap in the representation space with closed-set ones. Extensive experiments on synthetic and real-world datasets validate the superiority of our approach. Notably, with minor modifications, DivideMix with OpenAda achieves performance improvements of 9.31% and 18.26% on the open-world CIFAR-80 dataset under 80% symmetric noise and 40% asymmetric noise. The code is available at https://***/chenchenzong/OpenAda. © 2025 IEEE. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Overview Paper A Comprehensive Survey of Digital Image Steganography and Steganalysis

引用

APSIPA Transactions on Signal and Information Processing 2024年第1期13卷

作者： Luo, Weiqi Wei, Kangkang Li, Qiushi Ye, Miaoxin Tan, Shunquan Tang, Weixuan Huang, Jiwu School of Computer Science and Engineering Sun Yat-sen University China School of Software Nanchang University China Shenzhen Key Laboratory of Media Security Shenzhen University China Institute of Artificial Intelligence Guangzhou University China Guangdong Laboratory of Machine Perception and Intelligent Computing Faculty of Engineering Shenzhen MSU-BIT University China

In the realm of digital communications, steganography and steganalysis have become a solution for securely exchanging covert information. This survey initiates with an exploration of the widely used passive-warden scenario model, analyzing its significance, key performance indicators, relevant databases, and clarifying some commonly misunderstood fundamental concepts associated with this model. Subsequently, the paper comprehensively examines the evolution and current state of digital image steganography and steganalysis, highlighting the transition from traditional handcrafted based methods to sophisticated deep learning based techniques developed over the past two decades. It offers thorough descriptions and evaluations of typical methods in both steganography and steganalysis, with a particular emphasis on deep learning-based techniques that have emerged in recent years. Furthermore, the survey identifies significant challenges currently faced in translating theoretical research into practical applications. By integrating these insights, the survey not only charts the historical development and technological advancements in steganography and steganalysis but also establishes a proactive agenda for future research aimed at enhancing security in covert communications. © 2024 W. Luo, K. Wei, Q. Li, M. Ye, S. Tan, W. Tang and J. Huang.

关键词： Steganalysis steganography

来源：评论

学校读者我要写书评

暂无评论

DCSF-KD: Dynamic Channel-wise Spatial Feature Knowledge Distillation for Object Detection 39

DCSF-KD: Dynamic Channel-wise Spatial Feature Knowledge Dist...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Dai, Tao Lin, Yang Guo, Hang Wang, Jinbao Zhu, Zexuan College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen China Shenzhen City Key Laboratory of Embedded System Design Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China

ISBN: (纸本)157735897X

Knowledge distillation (KD) has recently gained great success in the field of object detection. By transferring the knowledge of the spatial or channel domain from the teacher model to the student model, it allows for a more compact representation with minimal performance loss. Despite this progress, existing KD methods typically treat knowledge from spatial or channel domains independently, ignoring the exploitation of the mutual relationship between these domains. In this work, we first explore the connection between spatial and channel domains and find there exists a strong correlation between them, i.e. the salient channels tend to contain significant object regions in the spatial domain. Motivated by this observation, we propose DCSF-KD, a novel Dynamic Channel-wise Spatial Feature Knowledge Distillation framework for object detection by fully exploiting both spatial and channel knowledge. Specifically, we introduce channel-wise spatial feature distillation and global channel attention distillation, using information from both domains to improve the accuracy of the student network. Experiments demonstrate that our DCSF-KD outperforms existing detection methods on both homogeneous and heterogeneous teacher-student network pairs. For example, when using the MaskRCNN-Swin detector as the teacher, and based on RetinaNet and FCOS with ResNet-50 on MS COCO, our DCSF-KD can achieve 41.9% and 44.1% mAP, respectively. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：