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

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

作者： Hongyan Xu Xiaohuan Pei Xiu Su Shan You Chang Xu School of Computer Science and Engineering University of New South Wales Australia Data61 The Commonwealth Scientific and Industrial Research Organisation (CSIRO) School of Computer Science Faculty of Engineering The University of Sydney Australia Big Data Institute Central South University SenseTime Research

Code clone detection aims at finding code fragments with syntactic or semantic similarity. Most of current approaches mainly focus on detecting syntactic similarity while ignoring semantic long-term context alignment, and these detection methods encode the source code using human-designed models, a process which requires both expert input and a significant cost of time for experimentation and refinement. To address these challenges, we introduce the Transformer Code Neural Architecture Search (TCNAS), an approach designed to optimize transformer-based architectures for detection. In TCNAS, all channels are trained and evaluated equitably to enhance search efficiency. Besides, we introduce the dataflow of the code by extracting the semantic information from the code fragments. TCNAS facilitates the discovery of an optimal model structure geared towards the detection, eliminating the need for manual design. The searched optimal architecture is utilized to detect the code pairs. We conduct various empirical experiments on the benchmark, which covering all four types of code clone detection. The results demonstrate our approach consistently yields competitive detection scores across a range of evaluations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stealthy Backdoor Attack Towards Federated Automatic Speaker Verification

Stealthy Backdoor Attack Towards Federated Automatic Speaker...

引用

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

作者： Longling Zhang Lyqi Liu Dan Meng Jun Wang Shengshan Hu School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security OPPO Research Institute China

Automatic speech verification (ASV) authenticates individuals based on distinct vocal patterns, playing a pivotal role in many applications such as voice-based unlocking systems for devices. The ASV system comprises three stages: training, registration, and validation. The model refines using voice data in training, extracts vocal features in registration, and contrasts these with speech patterns in validation. Modern ASV models, primarily grounded in DNN architectures, require extensive data for training. Federated learning (FL) fosters model-sharing across multiple clients while ensuring data privacy. Due to its open architecture, FL is vulnerable to backdoor attacks. However, training a stealthy backdoor attack in FL presents challenges, including diminished attack generalization owing to data heterogeneity, and conspicuous triggers that render them easily detectable. In this paper, we propose a Federated Stealthy Backdoor Attack method ($FedSBA$). FedSBA aims to improve the attack model’s generalization, enhance its persistence, and elude anomaly detection under the heterogeneous data distribution. FedSBA constructs an attack model based on a personalized transformer and encompasses a stealthy trigger. Moreover, we also propose a defensive strategy that utilizes an adaptive weight aggregation scheme. The stealthiness and effectiveness of FedSBA are demonstrated by exhibiting superior performance in comparison to previous works.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A pretrained transformer model for decoding individual glucose dynamics from continuous glucose monitoring data

引用

National science Review 2025年第5期12卷 362-381页

作者： Yurun Lu Dan Liu Zhongming Liang Rui Liu Pei Chen Yitong Liu Jiachen Li Zhanying Feng Lei M.Li Bin Sheng Weiping Jia Luonan Chen Huating Li Yong Wang Center for Excellence in Mathematical Sciences National Center for Mathematics and Interdisciplinary Sciences Hua Loo-Keng Center for Mathematical Sciences Key Laboratory of Management Decision and Information System Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematics University of Chinese Academy of SciencesChinese Academy of Sciences Department of Endocrinology and Metabolism Shanghai Sixth People's Hospital Affiliated to Shanghai Jiao Tong University School of MedicineShanghai Diabetes InstituteShanghai Clinical Center for Diabetes Shanghai Key Laboratory of Diabetes Mellitus Key Laboratory of Systems Health Science of Zhejiang Province School of Life ScienceHangzhou Institute for Advanced StudyUniversity of Chinese Academy of Sciences BGI-Research School of Mathematics South China University of Technology Department of Statistics Department of Biomedical Data Science Bio-X ProgramStanford University Department of Computer Science and Engineering Shanghai Jiao Tong University State Key Laboratory of Cell Biology Center for Excellence in Molecular Cell Science Shanghai Institute of Biochemistry and Cell Biology Chinese Academy of Sciences Guangdong Institute of Intelligence Science and Technology Pazhou Laboratory (Huangpu)

Continuous glucose monitoring(CGM) technology has grown rapidly to track real-time blood glucose levels and trends with improved sensor accuracy. The ease of use and wide availability of CGM will facilitate safe and effective decision making for diabetes management. Here, we developed an attention-based deep learning model, CGMformer, pretrained on a well-controlled and diverse corpus of CGM data to represent individual's intrinsic metabolic state and enable clinical applications. During pretraining, CGMformer encodes glucose dynamics including glucose level, fluctuation, hyperglycemia, and hypoglycemia into latent space with self-supervised learning. It shows generalizability in imputing glucose value across five external datasets with different populations and metabolic states(MAE = 3.7 mg/d L). We then fine-tuned CGMformer towards a diverse panel of downstream tasks in the screening of diabetes and its complications using task-specific data, which demonstrated a consistently boosted predictive accuracy over direct fine-tuning on a single task(AUROC = 0.914 for type 2 diabetes(T2D) screening and 0.741 for complication screening). By learning an intrinsic representation of an individual's glucose dynamics,CGMformer classifies non-diabetic individuals into six clusters with elevated T2D risks, and identifies a specific cluster with lean body-shape but high risk of glucose metabolism disorders, which is overlooked by traditional glucose measurements. Furthermore, CGMformer achieves high accuracy in predicting an individual's postprandial glucose response with dietary modelling(Pearson correlation coefficient = 0.763)and helps personalized dietary recommendations. Overall, CGMformer pretrains a transformer neural network architecture to learn an intrinsic representation by borrowing information from a large amount of daily glucose profiles, and demonstrates predictive capabilities fine-tuned towards a broad range of downstream applications, holding promise for the ear

关键词： pretrained model diabetes continuous glucose monitoring glucose dynamics

来源：评论

学校读者我要写书评

暂无评论

Applications of Machine Learning in Medicine: Current Trends and Prospects 6

Applications of Machine Learning in Medicine: Current Trends...

引用

6th Global Conference on Wireless and Optical Technologies, GCWOT 2023

作者： Aamir, Muhammad Bazai, Sibghatullah Bhatti, Uzair Aslam Dayo, Zaheer Ahmed Liu, Jing Zhang, Kun Huanggang Normal Univeristy College of Computer Science Huanggang China Balochistan University of Information Technology Engineering and Management Sciences Department of Computer Engineering Quetta Pakistan Hainan University School of Information and Communication Engineering Haikou China Zhejiang Lab Research Center for Healthcare Data Science Hangzhou China

ISBN: (纸本)9798350333718

With the continuous development of information technology and medical data information, more and more clinicians recognize artificial intelligence or will completely change medical practice by using advanced machine learning methods. The potential of using machine learning and predictive analysis to customize specific treatments for individuals is currently under research. Machine learning can learn a large number of medical data and explore the dependencies in data concentration, forming a corresponding medical model that can quickly and accurately predict new data, which is conducive to the early diagnosis of diseases and assisted clinical decisions. Clinical medicine faces the status quo of the relative shortage of medical resources and the identification and rapid diagnosis and treatment of critically ill emergency patients. In the era of big data, clinical demand is driven by clinical needs, and intelligent medical care provided by machines is the key to tackling the aforementioned issues. © 2023 IEEE.

关键词： Patient treatment

来源：评论

学校读者我要写书评

暂无评论

Generalizing Personalized Federated Graph Augmentation via Min-max Adversarial Learning 25

Generalizing Personalized Federated Graph Augmentation via M...

引用

Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and data Mining V.1

作者： Liang Zhang Tao Long Yang Liu Lei Zhang Laizhong Cui Qingjiang Shi Shenzhen Research Institute of Big Data Shenzhen Guangdong China College of Computer Science and Software Engineering Shenzhen University Shenzhen Guangdong China Data Science Research Center Dukekunshan University Kunshan Jiangsu China School of Software Engineering Tongji University Yangpu Shanghai China

ISBN: (纸本)9798400712456

Federated learning (FL) enables the training of a global machine learning model among multiple local clients in a collaborative fashion without directly sharing the details of their data. Due to this advantage, it has been utilized in a wide range of applications where privacy is a critical concern and has attracted great attention for graph representation learning (GRL). Despite the offered advances, there still exist two major challenges in the FL for GRL across distributed graph data, including heterogeneity and complementarity. In order to tackle these challenges, a novel personalized federated graph augmentation (PFGA) framework is proposed in this work. Unlike existing techniques, it utilizes generative models as bridges to enable information sharing among clients, thereby facilitating the collaborative training of GRL models. Instead of directly using the generative model trained on each client individually, we aggregate them into the globally generative model to gain a global view of the entire graph, which effectively alleviates the heterogeneity and complementarity issues simultaneously. We formulate the training of the generative and GRL models as a min-max adversarial learning problem and theoretically prove the convergence. Furthermore, the effectiveness of the method is demonstrated using experimental results on six real-world datasets.

关键词： federated learning

来源：评论

学校读者我要写书评

暂无评论

AI-Driven Sentiment Analysis for Music Composition 18th

AI-Driven Sentiment Analysis for Music Composition

引用

18th EAI International Conference on Tools for Design, Implementation and Verification of Emerging Information Technologies, TRIDENTCOM 2023

作者： Wang, Qinyuan Qu, Youyang Cheng, Haibo Yu, Yonghao Wang, Xiaodong Gu, Bruce Sydney Conservatorium of Music University of Sydney Sydney Australia Jinan China Faculty of Data Science City University of Macau China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China School of Engineering Design and Construction Melbourne Polytechnic Melbourne Australia

ISBN: (纸本)9783031513985

In the realm of music composition, sentiment plays a pivotal role in connecting compositions with their audience, evoking emotions and memories. With the rapid evolution of artificial intelligence (AI), there exists a burgeoning interest in utilizing AI for sentiment analysis in various domains, including textual data, social media, and film. This paper delves into the novel application of AI-driven sentiment analysis specifically tailored for music composition. Leveraging diverse music datasets across multiple genres and eras, we introduce an innovative methodology that breaks down music into foundational features such as melody, rhythm, timbre, and harmony. Through the application of advanced AI techniques, including neural networks and Long Short-Term Memory (LSTM) models, we aim to accurately map these features to a wide spectrum of sentiments. Our results showcase not only the potential accuracy and precision of our chosen models but also the richness of music compositions they can produce, underscoring the viability of AI in enhancing the emotional depth of musical works. The implications of this research stretch from aiding composers in creating more resonant pieces to the potential therapeutic applications of AI-composed music, tailored to specific emotional needs. © 2024, ICST Institute for computer sciences, Social Informatics and Telecommunications engineering.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

Pre-Training and Fine-Tuning for Efficient Routing in Opportunistic Networks

Pre-Training and Fine-Tuning for Efficient Routing in Opport...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Jia Hao Xiaorui Wu Winston K. G. Seah Feng Zhang Gang Xu Ministry of Education College of Computer Science Engineering Research Center of Ecological Big Data Inner Mongolia University Hohhot China School of Engineering & Computer Science Victoria University of Wellington Wellington New Zealand School of Computer and Information Technology Shanxi University Taiyuan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

In opportunistic networks, it is a challenge to find the best relay node instead of blindly selecting from among available nodes to forward messages and effectively transmit them to their destinations. By comparing the similarity between nodes, the next hop node that is most similar to the destination node is found in time. Existing node similarity-based opportunistic networks routing algorithms only calculate similarity between nodes according to nodes' properties that can be directly obtained from the network, such as the historical meeting record between nodes, etc. However, this superficial similarity calculation is obviously inadequate to describe the inherent dynamic nature of opportunistic networks at both spatial and temporal levels, and ignores the salient movement characteristics of nodes, resulting in poor routing performance. Therefore, this paper proposes an opportunistic network routing strategy based on pre-training and fine-tuning (PTFT) model. Firstly, an autoencoder is added to the graph neural network model to encode node movement behavior. Then, a pre-training graph neural network model in large scale opportunistic network scenarios is applied to learn potential features of nodes through fine-tuning. Finally, we calculate the similarity between nodes based on the node potential feature, thereby assisting the nodes to achieve an efficient routing decision. The simulation results show that our PTFT-based algorithm not only has superior performance compared to traditional routing algorithms, but also faster learning speed than other machine learning-based routing algorithms.

关键词： Representation learning Machine learning algorithms Simulation Heuristic algorithms Autoencoders Routing Feature extraction Graph neural networks Relays Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Can Language Models Serve as Temporal Knowledge Bases?

Can Language Models Serve as Temporal Knowledge Bases?

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Ruilin Zhao, Feng Xu, Guandong Zhang, Sixiao Jin, Hai 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 Data Science and Machine Intelligence Lab University of Technology Sydney Sydney Australia

Recent progress regarding the use of language models (LMs) as knowledge bases (KBs) has shown that language models can act as structured knowledge bases for storing relational facts. However, most existing works only considered the LM-as-KB paradigm in a static setting, which ignores the analysis of temporal dynamics of world knowledge. Furthermore, a basic function of KBs, i.e., the ability to store conflicting information (i.e., 1-N, N-1 and N-M relations), is underexplored. In this paper, we formulate two practical requirements for treating LMs as temporal KBs: (i) the capacity to store temporally-scoped knowledge that contains conflicting information and (ii) the ability to use stored knowledge for temporally-scoped knowledge queries. We introduce a new dataset called LAMA-TK which is aimed at probing temporally-scoped knowledge, and investigate the two above requirements to explore the LM-as-KB paradigm in the temporal domain. On the one hand, experiments show that LMs can memorize millions of temporally-scoped facts with relatively high accuracy and transfer stored knowledge to temporal knowledge queries, thereby expanding the LM-as-KB paradigm to the temporal domain. On the other hand, we show that memorizing conflicting information, which has been neglected by previous works, is still challenging for LMs and hinders the memorization of other unrelated one-to-one relationships. © 2022 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

LibAMM: Empirical Insights into Approximate Computing for Accelerating Matrix Multiplication 38

LibAMM: Empirical Insights into Approximate Computing for Ac...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zeng, Xianzhi Jiang, Wenchao Zhang, Shuhao National Engineering Research Center for Big DataTechnology 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 Nanyang Technological University Singapore Singapore University of Technology and Design Singapore

Matrix multiplication (MM) is pivotal in fields from deep learning to scientific computing, driving the quest for improved computational efficiency. Accelerating MM encompasses strategies like complexity reduction, parallel and distributed computing, hardware acceleration, and approximate computing techniques, namely AMM algorithms. Amidst growing concerns over the resource demands of large language models (LLMs), AMM has garnered renewed focus. However, understanding the nuances that govern AMM's effectiveness remains incomplete. This study delves into AMM by examining algorithmic strategies, operational specifics, dataset characteristics, and their application in real-world tasks. Through comprehensive testing across diverse datasets and scenarios, we analyze how these factors affect AMM's performance, uncovering that the selection of AMM approaches significantly influences the balance between efficiency and accuracy, with factors like memory access playing a pivotal role. Additionally, dataset attributes are shown to be vital for the success of AMM in applications. Our results advocate for tailored algorithmic approaches and careful strategy selection to enhance AMM's effectiveness. To aid in the practical application and ongoing research of AMM, we introduce LibAMM -a toolkit offering a wide range of AMM algorithms, benchmarks, and tools for experiment management. LibAMM aims to facilitate research and application in AMM, guiding future developments towards more adaptive and context-aware computational solutions. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Incentive Mechanism of Selfish Nodes Based on Energy Optimization and Game Theory

Incentive Mechanism of Selfish Nodes Based on Energy Optimiz...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： XiangJia Dong Yuan Cheng Winston K. G. Seah Feng Zhang Gang Xu Engineering Research Center of Ecological Big Data Ministry of Education College of Computer Science Inner Mongolia University Hohhot China School of Engineering & Computer Science Victoria University of Wellington Wellington New Zealand School of Computer and Information Technology Shanxi University Taiyuan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

With the proliferation of mobile intelligent terminals, opportunistic networks have attracted widespread attention as a complementary technology to multi-network convergence. Different from traditional wireless networks, message delivery in opportunistic networks does not rely on a fixed infrastructure, but rather storing messages in a cache and utilizing the movement and encounters of nodes to relay messages. However, in practical application scenarios, nodes have limited storage space and energy and will easily exhibit selfishness. An increase in the number of selfish nodes will drastically degrade the performance of the network. To solve the problem of significant network performance degradation when the number of selfish nodes is high, this paper proposes an Incentive mechanism of Selfish nodes based on Energy optimization and Game Theory (ISEGT). The mechanism abstracts the process of forwarding messages by nodes into a bargaining game process, and selectively forwards messages based on nodes' remaining energy and other circumstances. The experimental results show that the ISEGT mechanism can motivate selfish nodes to actively participate in message forwarding, which improves the success rate of message delivery and the survival rate of nodes, and optimizes the overall performance of the network.

关键词： Degradation Wireless networks Games Network security Delays Game theory Relays Optimization Cybernetics Energy storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：