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

arXiv 2023年

作者： Wang, Yifang Qian, Yifan Qi, Xiaoyu Cao, Nan Wang, Dashun The Center for Science of Science and Innovation Northwestern University United States Intelligent Big Data Visualization Lab Tongji University China

science has long been viewed as a key driver of economic growth and rising standards of living. Knowledge about how scientific advances support marketplace inventions is therefore essential for understanding the role of science in propelling real-world applications and technological progress. The increasing availability of large-scale datasets tracing scientific publications and patented inventions and the complex interactions among them offers us new opportunities to explore the evolving dual frontiers of science and technology at an unprecedented level of scale and detail. However, we lack suitable visual analytics approaches to analyze such complex interactions effectively. Here we introduce InnovationInsights, an interactive visual analysis system for researchers, research institutions, and policymakers to explore the complex linkages between science and technology, and to identify critical innovations, inventors, and potential partners. The system first identifies important associations between scientific papers and patented inventions through a set of statistical measures introduced by our experts from the field of the science of science. A series of visualization views are then used to present these associations in the data context. In particular, we introduce the Interplay Graph to visualize patterns and insights derived from the data, helping users effectively navigate citation relationships between papers and patents. This visualization thereby helps them identify the origins of technical inventions and the impact of scientific research. We evaluate the system through two case studies with experts followed by expert interviews. We further engage a premier research institution to test-run the system, helping its institution leaders to extract new insights for innovation. Through both the case studies and the engagement project, we find that our system not only meets our original goals of design, allowing users to better identify the sources of technical inv

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

Real is not True: Backdoor Attacks Against Deepfake Detection

arXiv

引用

arXiv 2024年

作者： Sun, Hong Li, Ziqiang Liu, Lei Li, Bin University of Science and Technology of China Hefei230027 China Laboratory for Big Data and Decision Zhejiang Lab. Zhejiang Hangzhou311121 China

The proliferation of malicious deepfake applications has ignited substantial public apprehension, casting a shadow of doubt upon the integrity of digital media. Despite the development of proficient deepfake detection mechanisms, they persistently demonstrate pronounced vulnerability to an array of attacks. It is noteworthy that the pre-existing repertoire of attacks predominantly comprises adversarial example attack, predominantly manifesting during the testing phase. In the present study, we introduce a pioneering paradigm denominated as"Bad-Deepfake," which represents a novel foray into the realm of backdoor attacks levied against deepfake detectors. Our approach hinges upon the strategic manipulation of a delimited subset of the training data, enabling us to wield disproportionate influence over the operational characteristics of a trained model. This manipulation leverages inherent frailties inherent to deepfake detectors, affording us the capacity to engineer triggers and judiciously select the most efficacious samples for the construction of the poisoned set. Through the synergistic amalgamation of these sophisticated techniques, we achieve an remarkable performance—a 100% attack success rate (ASR) against extensively employed deepfake detectors. © 2024, CC BY.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Learning Beams Adaptive to the Environment: An RSRP-based Codebook Design 24

Learning Beams Adaptive to the Environment: An RSRP-based Co...

引用

24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2023

作者： Ning, Xinzhi Zhang, Shutao Xue, Ye Zheng, Xi Shi, Qingjiang Chang, Tsung-Hui Tongji University School of Software Engineering Shanghai China Pengcheng Lab Shenzhen China The Chinese University of HongKong School of Science and Engineering Shenzhen China Shenzhen Research Institute of Big Data Shenzhen China Huawei Technologies Networking and User Experience Lab Shenzhen China

ISBN: (纸本)9781665496261

The design of an effective codebook is crucial for the fifth generation (5G) systems, particularly in the context of massive multiple-input-multiple-output (MIMO) and millimeter wave communication. However, existing codebook design methods that rely on the instantaneous channel impulse response (CIR) face challenges in adapting to dynamic channels that undergo small-scale fading changes. To address this issue, this paper proposes a novel two-stage codebook design framework based solely on the reference signal receiving power (RSRP), which provides large-scale statistical information about environment attenuation. The proposed approach involves two stages: first, the angular power spectrum (APS) is estimated through sparse Bayesian learning (SBL), which uses the statistical relationship between APS and RSRP. Second, an iterative clustering and optimization algorithm is used to determine the optimal codebook based on the estimated APS. Experimental results demonstrate that the proposed codebook design framework with a smaller number of beams can adapt to localized environment well and achieves better performance than the classical DFT codebook. © 2023 IEEE.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

arXiv

引用

arXiv 2025年

作者： Bi, Zhangqian Wan, Yao Chu, Zhaoyang Hu, Yufei Zhang, Junyi Zhang, Hongyu Xu, Guandong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is computationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks. © 2025, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Communication-Efficient Distributed Learning with Local Immediate Error Compensation

arXiv

引用

arXiv 2024年

作者： Cheng, Yifei Shen, Li Xu, Linli Qian, Xun Wu, Shiwei Zhou, Yiming Zhang, Tie Tao, Dacheng Chen, Enhong The Anhui Province Key Lab of Big Data Analysis and Application State Key Laboratory of Cognitive Intelligence School of Data Science School of Computer Science University of Science and Technology China The JD Explore Academy China The Shanghai Artificial Intelligence Laboratory China

Gradient compression with error compensation has attracted significant attention with the target of reducing the heavy communication overhead in distributed learning. However, existing compression methods either perform only unidirectional compression in one iteration with higher communication cost, or bidirectional compression with slower convergence rate. In this work, we propose the Local Immediate Error Compensated SGD (LIEC-SGD) optimization algorithm to break the above bottlenecks based on bidirectional compression and carefully designed compensation approaches. Specifically, the bidirectional compression technique is to reduce the communication cost, and the compensation technique compensates the local compression error to the model update immediately while only maintaining the global error variable on the server throughout the iterations to boost its efficacy. Theoretically, we prove that LIEC-SGD is superior to previous works in either the convergence rate or the communication cost, which indicates that LIEC-SGD could inherit the dual advantages from unidirectional compression and bidirectional compression. Finally, experiments of training deep neural networks validate the effectiveness of the proposed LIEC-SGD algorithm. Copyright © 2024, The Authors. All rights reserved.

关键词： Error compensation

来源：评论

学校读者我要写书评

暂无评论

Effective and Robust Detection of Adversarial Examples via Benford-Fourier Coefficients

引用

Machine Intelligence Research 2022年

作者： Cheng-Cheng Ma Bao-Yuan Wu Yan-Bo Fan Yong Zhang Zhi-Feng Li National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences School of Artificial Intelligence University of Chinese Academy of Sciences School of Data Science The Chinese University of Hong Kong Shenzhen Research Institute of Big Data AI Lab Tencent Inc.

Adversarial example has been well known as a serious threat to deep neural networks(DNNs). In this work, we study the detection of adversarial examples based on the assumption that the output and internal responses of one DNN model for both adversarial and benign examples follow the generalized Gaussian distribution(GGD) but with different parameters(i.e., shape factor, mean, and variance). GGD is a general distribution family that covers many popular distributions(e.g., Laplacian, Gaussian, or uniform). Therefore, it is more likely to approximate the intrinsic distributions of internal responses than any specific distribution. Besides, since the shape factor is more robust to different databases rather than the other two parameters, we propose to construct discriminative features via the shape factor for adversarial detection, employing the magnitude of Benford-Fourier(MBF) coefficients, which can be easily estimated using responses. Finally, a support vector machine is trained as an adversarial detector leveraging the MBF features. Extensive experiments in terms of image classification demonstrate that the proposed detector is much more effective and robust in detecting adversarial examples of different crafting methods and sources compared to state-of-the-art adversarial detection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

How to Select Pre-Trained Code Models for Reuse? A Learning ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Zhangqian Bi Yao Wan Zhaoyang Chu Yufei Hu Junyi Zhang Hongyu Zhang Guandong Xu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

ISBN: (数字)9798331535100

ISBN: (纸本)9798331535117

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is compu-tationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks.

关键词： Phase change materials Analytical models Adaptation models Codes Costs Computational modeling Training data Machine learning Software Software development management

来源：评论

学校读者我要写书评

暂无评论

LOPO: An Out-of-order Layer Pulling Orchestration Strategy for Fast Microservice Startup 42

LOPO: An Out-of-order Layer Pulling Orchestration Strategy f...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Gu, Lin Huang, Junhao Huang, Shaoxing Zeng, Deze Li, Bo 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 China University of Geosciences School of Computer Science Wuhan China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Container based microservices have been widely applied to promote the cloud elasticity. The mainstream Docker containers are structured in layers, which are organized in stack with bottom-up dependency. To start a microservice, the required layers are pulled from a remote registry and stored on its host server, following the layer dependency order. This incurs long microservice startup time and hinders the performance efficiency. In this paper, we discover that, for the first time, the layer pulling order can be adjusted to accelerate the microservice startup. Specifically, we address the problem on microservice layer pulling orchestration for startup time minimization and prove it as NP-hard. We propose a Longest-chain based Out-of-order layer Pulling Orchestration (LOPO) strategy with low computational complexity and guaranteed approximation ratio. Through extensive real-world trace driven experiments, we verify the efficiency of our LOPO and demonstrate that it reduces the microservice startup time by 22.71% on average in comparison with state-of-the-art solutions. © 2023 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

FedMoS: Taming Client Drift in Federated Learning with Double Momentum and Adaptive Selection 42

FedMoS: Taming Client Drift in Federated Learning with Doubl...

引用

42nd IEEE International Conference on Computer Communications, INFOCOM 2023

作者： Wang, Xiong Chen, Yuxin Li, Yuqing Liao, Xiaofei Jin, Hai Li, Bo Cluster and Grid Computing Lab 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 Wuhan China Wuhan University School of Cyber Science and Engineering Wuhan China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350334142

Federated learning (FL) enables massive clients to collaboratively train a global model by aggregating their local updates without disclosing raw data. Communication has become one of the main bottlenecks that prolongs the training process, especially under large model variances due to skewed data distributions. Existing efforts mainly focus on either single momentum-based gradient descent, or random client selection for potential variance reduction, yet both often lead to poor model accuracy and system efficiency. In this paper, we propose FedMoS, a communication-efficient FL framework with coupled double momentum-based update and adaptive client selection, to jointly mitigate the intrinsic variance. Specifically, FedMoS maintains customized momentum buffers on both server and client sides, which track global and local update directions to alleviate the model discrepancy. Taking momentum results as input, we design an adaptive selection scheme to provide a proper client representation during FL aggregation. By optimally calibrating clients' selection probabilities, we can effectively reduce the sampling variance, while ensuring unbiased aggregation. Through a rigid analysis, we show that FedMoS can attain the theoretically optimal O(T - 2/3) convergence rate. Extensive experiments using real-world datasets further validate the superiority of FedMoS, with 58%-87% communication reduction for achieving the same target performance compared to state-of-the-art techniques. © 2023 IEEE.

关键词： Momentum

来源：评论

学校读者我要写书评

暂无评论

Explainable machine learning for sleep apnea prediction

引用

Procedia Computer science 2022年 207卷 2930-2939页

作者： A.R. Troncoso-García M. Martínez-Ballesteros F. Martínez-Álvarez A. Troncoso Data Science and Big Data Lab Pablo de Olavide University 41013 ES-Seville Spain Department of Computer Science University of Seville 41012 ES-Seville Spain

Machine and deep learning has become one of the most useful tools in the last years as a diagnosis-decision-support tool in the health area. However, it is widely known that artificial intelligence models are considered a black box and most experts experience difficulties explaining and interpreting the models and their results. In this context, explainable artificial intelligence is emerging with the aim of providing black-box models with sufficient interpretability so that models can be easily understood and further applied. Obstructive sleep apnea is a common chronic respiratory disease related to sleep. Its diagnosis nowadays is done by processing different data signals, such as electrocardiogram or respiratory rate. The waveform of the respiratory signal is of importance too. Machine learning models could be applied to the signal's analysis. data from a polysomnography study for automatic sleep apnea detection have been used to evaluate the use of the Local Interpretable Model-Agnostic (LIME) library for explaining the health data models. Results obtained help to understand how several features have been used in the model and their influence in the quality of sleep.

关键词： Explainable artificial intelligence health data polysomnography LIME

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：