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

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

作者： Amashi Niwarthana Chockalingam Kasi Yi Hao Chan Conghao Wang Jagath C Rajapakse College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Although brain imaging has provided crucial insights into Alzheimer’s disease (AD) progression, its limitations in capturing molecular changes have motivated the need to integrate and interpret transcriptomic data, which can reveal early-stage molecular disruptions. By interpreting both structural and gene expression patterns, there is potential to gain a more comprehensive understanding of the disease and identify interactions that drive AD pathogenesis. This study introduces a novel deep learning framework that integrates structural magnetic resonance imaging (sMRI) and gene expression (GE) data for AD prediction. The model extracts features from both data modalities and employs a novel approach to quantify cross-modal interactions. Our multimodal architecture achieves 83.6% accuracy in AD prediction, demonstrating its effectiveness in combining imaging and transcriptomic data. We present a technique for interpreting interactions between specific brain regions and gene expression patterns, providing insights into their joint contribution to AD risk. This approach enables the identification of both established and potential new AD biomarkers, spanning structural brain changes and transcriptomic alterations. By offering a deeper understanding of AD’s molecular and structural aspects, our work advances the field of multimodal biomarker discovery in neurodegenerative diseases and paves the way for more comprehensive early diagnosis strategies.

关键词： Pathology Magnetic resonance imaging Transcriptomics Biomarkers Feature extraction Brain modeling data models Decoding Gene expression Alzheimer's disease

来源：评论

学校读者我要写书评

暂无评论

Generating Apoptosis-Inducing Anticancer Peptides Targeting BCL-xL Using Latent Diffusion Models on Small datasets

Generating Apoptosis-Inducing Anticancer Peptides Targeting ...

引用

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

作者： Tiara Natasha Binte Sayuti Wang Conghao Jagath C Rajapakse College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The overexpression of B-cell lymphoma-extra large (BCL-xL), an anti-apoptotic protein, plays a pivotal role in various cancers by inhibiting apoptosis and promoting tumor progression. We introduce Latent Diffusion Model (LDM) specifically designed to generate apoptosis-inducing Anticancer Peptides (ACPs) targeting BCL-xL. By applying a diffusion process to high-dimensional embeddings generated by ESM-2, a state-of-the-art Protein Language Model (PLM), our approach successfully generates peptides with optimal physicochemical properties, even when trained on a relatively small dataset. In comparison to Variational Autoencoder (VAE) and Wasserstein Autoencoder (WAE), our architecture not only mitigates the limitations associated with small datasets but also produces peptides that closely align with desired physiochemical properties. Evaluation against key metrics—molecular weight, isoelectric point, net charge at pH 7, grand average of hydropathy, instability index, and anticancer peptide score,demonstrates that our model consistently outperforms both VAE and WAE, offering a promising strategy for the development of novel anticancer therapies.

关键词： Proteins Peptides Computational modeling Autoencoders Medical treatment Signal processing Diffusion models Structural engineering Speech processing Tumors

来源：评论

学校读者我要写书评

暂无评论

Uncertainty-Aware Explainable Federated Learning

arXiv

引用

arXiv 2025年

作者： Zhang, Yanci Yu, Han College of Computing and Data Science Nanyang Technological University Singapore

Federated Learning (FL) is a collaborative machine learning paradigm for enhancing data privacy preservation. Its privacy-preserving nature complicates the explanation of the decision-making processes and the evaluation of the reliability of the generated explanations. In this paper, we propose the Uncertainty-aware eXplainable Federated Learning (UncertainXFL) to address these challenges. It generates explanations for decision-making processes under FL settings and provides information regarding the uncertainty of these explanations. UncertainXFL is the first framework to explicitly offer uncertainty evaluation for explanations within the FL context. Explanatory information is initially generated by the FL clients and then aggregated by the server in a comprehensive and conflict-free manner during FL training. The quality of the explanations, including the uncertainty score and tested validity, guides the FL training process by prioritizing clients with the most reliable explanations through higher weights during model aggregation. Extensive experimental evaluation results demonstrate that UncertainXFL achieves superior model accuracy and explanation accuracy, surpassing the current state-of-the-art model that does not incorporate uncertainty information by 2.71% and 1.77%, respectively. By integrating and quantifying uncertainty in the data into the explanation process, UncertainXFL not only clearly presents the explanation alongside its uncertainty, but also leverages this uncertainty to guide the FL training process, thereby enhancing the robustness and reliability of the resulting models. © 2025, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

DAGGER BEHIND SMILE: FOOL LLMS WITH A HAPPY ENDING STORY

arXiv

引用

arXiv 2025年

作者： Song, Xurui Xie, Zhixin Huai, Shuo Kong, Jiayi Luo, Jun College of Computing and Data Science Nanyang Technological University Singapore

The wide adoption of Large Language Models (LLMs) has attracted significant attention from jailbreak attacks, where adversarial prompts crafted through optimization or manual design exploit LLMs to generate malicious contents. However, optimization-based attacks have limited efficiency and transferability, while existing manual designs are either easily detectable or demand intricate interactions with LLMs. In this paper, we first point out a novel perspective for jailbreak attacks: LLMs are more responsive to positive prompts. Based on this, we deploy Happy Ending Attack (HEA) to wrap up a malicious request in a scenario template involving a positive prompt formed mainly via a happy ending, it thus fools LLMs into jailbreaking either immediately or at a follow-up malicious request. This has made HEA both efficient and effective, as it requires only up to two turns to fully jailbreak LLMs. Extensive experiments show that our HEA can successfully jailbreak on state-of-the-art LLMs, including GPT-4o, Llama3-70b, Gemini-pro, and achieves 88.79% attack success rate on average. We also provide quantitative explanations for the success of HEA. WARNING: This paper contains offensive and harmful content generated by LLMs. Copyright © 2025, The Authors. All rights reserved.

关键词： Computer simulation languages

来源：评论

学校读者我要写书评

暂无评论

Utility-Cost Ratio Maximization in Quantum Networks for Secure Quantum Key Distribution

Utility-Cost Ratio Maximization in Quantum Networks for Secu...

引用

Quantum Communications, Networking, and computing (QCNC), International Conference on

作者： Liangxin Qian Jun Zhao College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798331531591

ISBN: (纸本)9798331531607

In this paper, we study the utility-cost ratio (UCR) maximization problem in quantum networks, with a particular focus on secure quantum key distribution (QKD). We propose the Quantum Utility-Cost Optimization (QUCO) algorithm to address the challenge of balancing network utility with operational and infrastructure costs. The utility of the network is measured based on the secret key fraction, a key performance metric in QKD, while the costs considered include operational and maintenance expenses, transceiver deployment, auxiliary equipment, and wavelength channel usage. The QUCO algorithm transforms the original non-convex problem into a convex optimization through a series of transformations, enabling efficient resource allocation across quantum network routes. Our simulation results, conducted on a realistic quantum network topology, demonstrate the algorithm’s ability to improve the utility-cost ratio while maintaining high network performance. The QUCO algorithm strikes a balance between minimizing costs and maintaining high end-to-end entanglement fidelity, which is effective for optimizing UCR in quantum networks.

关键词： Costs Network topology Wavelength measurement Transforms Transceivers Quantum key distribution Topology Quantum networks Resource management Optimization

来源：评论

学校读者我要写书评

暂无评论

SparseMamba-PCL: Scribble-Supervised Medical Image Segmentation via SAM-Guided Progressive Collaborative Learning

arXiv

引用

arXiv 2025年

作者： Qiu, Luyi Till, Tristan Guo, Xiaobao Kong, Adams Wai-Kin College of Computing and Data Science Nanyang Technological University Singapore

Scribble annotations significantly reduce the cost and labor required for dense labeling in large medical datasets with complex anatomical structures. However, current scribble-supervised learning methods are limited in their ability to effectively propagate sparse annotation labels to dense segmentation masks and accurately segment object boundaries. To address these issues, we propose a Progressive Collaborative Learning framework that leverages novel algorithms and the Med-SAM foundation model to enhance information quality during training. (1) We enrich ground truth scribble segmentation labels through a new algorithm, propagating scribbles to estimate object boundaries. (2) We enhance feature representation by optimizing Med-SAM-guided training through the fusion of feature embeddings from Med-SAM and our proposed Sparse Mamba network. This enriched representation also facilitates the fine-tuning of the Med-SAM decoder with enriched scribbles. (3) For inference, we introduce a Sparse Mamba network, which is highly capable of capturing local and global dependencies by replacing the traditional sequential patch processing method with a skip-sampling procedure. Experiments on the ACDC, CHAOS, and MSCMRSeg datasets validate the effectiveness of our framework, outperforming nine state-of-the-art methods. Our code is available at ***. © 2025, CC BY.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Agnostic Weakly Supervised Method For Describing Textures

An Encoder-Agnostic Weakly Supervised Method For Describing ...

引用

IEEE Workshop on Applications of Computer Vision (WACV)

作者： Shangbo Mao Deepu Rajan College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (数字)9798331510831

ISBN: (纸本)9798331510848

Recent advances in Large Language Models (LLMs) have enabled the semantic description of textures in natural language, aiming to capture them in richer detail. However, most methods are confined to either depending on supervised training with pairs of images and manually annotated visual attributes that most texture datasets lack or using Vision-Language Models (VLMs) such as CLIP. In this paper, we develop an encoder-agnostic Weakly supervised Texture Description Generator (WTDG) that employs a novel Scaled Ranked Kullback-Leibler divergence (SR-KL) loss between image and text modalities. Within the SR-KL loss formulation, we leverage category information, which is always available as ground-truths for all benchmark texture recognition datasets. We further extend our proposed WTDG to assist in texture recognition by using its generated texture descriptions. Thus, we develop a multimodal framework, called $T e x^2$ , which is adept at simultaneous generation of texture description and recognition. Our approach exhibits promising performance in describing and recognizing textures on benchmark datasets.

关键词： Training Visualization Computer vision Accuracy Large language models Semantics Natural languages Benchmark testing Generators

来源：评论

学校读者我要写书评

暂无评论

CRP: A Cluster-Based Routing Protocol for Lightweight Nodes in Payment Channel Networks

引用

IEEE Transactions on Network and Service Management 2025年

作者： Chen, Jinghui Cai, Qingqing Sun, Gang Yu, Hongfang Niyato, Dusit Chengdu611731 China Nanyang Technological University College of Computing and Data Science Singapore

Although blockchain empowers the IoT trading market and presents new development opportunities for IoT, scalability issues of blockchain limit its application in this area. Payment Channel Networks (PCNs) have emerged as a promising solution to address the scalability issues. With the help of routing protocols, two users can utilize payment channels to conduct off-chain transactions. However, most Payment Channel Network (PCN) routing protocols overlook the scalability of PCNs, resulting in substantial storage, communication, and computational overhead for lightweight nodes, such as IoT devices. Additionally, frequent utilization of a payment channel can quickly exhaust the channel’s balance, leading to congestion and causing subsequent payments to fail. Channel congestion restricts the throughput of PCNs, yet most PCN routing protocols lack designs for channel congestion control. In this paper, we propose a Cluster-based scalable and high-throughput Routing Protocol (CRP), to enhance the scalability and throughput of PCNs. CRP organizes PCNs into clusters to reduce the average routing table size, thereby alleviating users’ storage, communication, and computational overhead. Furthermore, CRP aims to minimize maximum channel congestion when selecting payment routes, thereby improving throughput. Extensive simulations demonstrate that CRP achieves high scalability and throughput compared to state-of-the-art PCN routing protocols. © 2004-2012 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

MQM-APE: Toward High-Quality Error Annotation Predictors with Automatic Post-Editing in LLM Translation Evaluators 31

MQM-APE: Toward High-Quality Error Annotation Predictors wit...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Lu, Qingyu Ding, Liang Zhang, Kanjian Zhang, Jinxia Tao, Dacheng Southeast University China The University of Sydney Australia Southeast University Shenzhen Research Institute China College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore

ISBN: (纸本)9798891761964

Large Language Models (LLMs) have shown significant potential as judges for Machine Translation (MT) quality assessment, providing both scores and fine-grained feedback. Although approaches such as GEMBA-MQM (Kocmi and Federmann, 2023a) have shown state-of-the-art performance on reference-free evaluation, the predicted errors do not align well with those annotated by human, limiting their interpretability as feedback signals. To enhance the quality of error annotations predicted by LLM evaluators, we introduce a universal and training-free framework, MQM-APE, based on the idea of filtering out non-impactful errors by Automatically Post-Editing (APE) the original translation based on each error, leaving only those errors that contribute to quality improvement. Specifically, we prompt the LLM to act as (1) evaluator to provide error annotations, (2) post-editor to determine whether errors impact quality improvement and (3) pairwise quality verifier as the error filter. Experiments show that our approach consistently improves both the reliability and quality of error spans against GEMBA-MQM, across eight LLMs in both high- and low-resource languages. Orthogonal to trained approaches, MQM-APE complements translation-specific evaluators such as Tower, highlighting its broad applicability. Further analysis confirms the effectiveness of each module and offers valuable insights into evaluator design and LLMs selection. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Extending Whisper for Emotion Prediction Using Word-level Pseudo Labels

Extending Whisper for Emotion Prediction Using Word-level Ps...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Kwok, Chin Yuen Li, Sheng Yip, Jia Qi Chu, Chenhui Kawahara, Tatsuya Chng, Eng Siong Digital Trust Centre Nanyang Technological University Singapore College of Computing and Data Science Nanyang Technological University Singapore Japan Kyoto University Japan

ISBN: (纸本)9798350368741

This paper extends Whisper's automatic speech recognition (ASR) capabilities to perform speech-based emotion recognition (SER) by incorporating word-level emotion classification alongside ASR output. We generate four emotion pseudo-labels (neutral, happy, sad, angry) for each word using a pretrained frame-level SER model, and Whisper is fine-tuned for joint ASR and emotion classification at the word level. Sentence-level emotion labels are masked during training to encourage the transformer to use the ASR output for word-level emotion prediction. During inference, word-level predictions are combined with sentence-level predictions through majority voting to generate the final sentence-level label. When evaluated on the IEMOCAP dataset, our method maintains Whisper's ASR word error rate while improving the SER weighted accuracy from 74.4% to 76.4% and the unweighted average recall from 77.1% to 79.0%. © 2025 IEEE.

关键词： automatic speech recognition (ASR) catastrophic forgetting continual learning instruction-tuning speech emotion recognition (SER)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：