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

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 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 Cluster and Grid Computing Lab China JinYinHu Laboratory Wuhan China

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Predicting Transcription Factor Binding Signals Based on a Novel Encoder-Decoder Framework 2nd

Predicting Transcription Factor Binding Signals Based on a N...

引用

2nd International Conference on Applied Intelligence, ICAI 2024

作者： Wang, Siguo Li, Zhipeng Zhang, Qinhu Ningbo Institute of Digital Twin Eastern Institute of Technology No. 568 Tongxin Road Zhuangshi Street Zhejiang Ningbo315201 China Big Data and Intelligent Computing Research Center Guangxi Academy of Science Nanning530007 China Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology School of Medicine Shanghai East Hospital Tongji University Shanghai200123 China

ISBN: (纸本)9789819619061

The transcription process is the initial step in gene expression and the core of the regulatory mechanism, in which transcription factors control gene expression through interactions with particular DNA sequences. Therefore, identification of transcription factor binding sites (TFBSs) provides theoretical basis for further dissection of transcriptional regulatory mechanisms and disease diagnosis. To address the limitations of current research on TFBSs, a novel symmetric Encoder-Decoder framework is proposed for predicting transcription factor binding signals values at base sites. Our approach utilizes word vectors to encode DNA sequences, followed by encoders that progressively extract feature representations from these sequences. We then employ Gated Recurrent Unit (GRU) to capture the contextual dependencies within the sequences, ultimately using decoders to reconstruct the binding signal values for the DNA sequence sites. In order to access the effectiveness of the proposed symmetric Encoder-Decoder framework, some experiments were conducted on 20 ChIP-seq datasets, and the results show that the proposed novel method outperformers several existing advanced methods. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： DNA sequences

来源：评论

学校读者我要写书评

暂无评论

A Self-Supervised Transfer Learning Framework for Gland Segmentation in Colorectal Cancer Histopathology with Limited Labeled data 2nd

A Self-Supervised Transfer Learning Framework for Gland Segm...

引用

2nd International Conference on Applied Intelligence, ICAI 2024

作者： Wen, Huer Wu, Yan Huang, De-Shuang Institute for Regenerative Medicine Medical Innovation Center and State Key Laboratory of Cardiology Shanghai East Hospital School of Medicine Tongji University Shanghai200123 China Big Data and Intelligent Computing Research Center Guangxi Academy of Science Nanning530007 China Ningbo Institute of Digital TwinEastern Institute of Technology No. 568 Tongxin Road Zhuangshi Street Zhejiang Ningbo315201 China

ISBN: (纸本)9789819619061

Accurate gland segmentation in colorectal cancer histopathology images is crucial for diagnosis and grading but is hampered by the limited availability of annotated data. To develop a robust and accurate gland segmentation method that effectively leverages unlabeled data to overcome the limitations of small annotated datasets. We propose a novel framework that combines self-supervised learning and transfer learning. A vision transformer is pre-trained using DINOv2 on a large unlabeled dataset (IMP-CRS-2024) and then fine-tuned on the GlaS dataset using a lightweight decoder and a boundary-aware loss function that combines Dice loss and a distance transform-weighted boundary loss. Our method achieves state-of-the-art performance on the GlaS dataset, surpassing existing methods in terms of F1-score, Object Dice, and Object Hausdorff distance. An ablation study confirms the benefits of both the self-supervised pre-training and the boundary-aware loss. Our approach effectively addresses the challenge of limited annotated data in gland segmentation, offering a promising solution for improving the accuracy and efficiency of colorectal cancer diagnosis. The framework can be generalized to other histopathology image analysis tasks and cancer types. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

CA-Edit: Causality-Aware Condition Adapter for High-Fidelity Local Facial Attribute Editing

arXiv

引用

arXiv 2024年

作者： Xian, Xiaole He, Xilin Niu, Zenghao Zhang, Junliang Xie, Weicheng Song, Siyang Yu, Zitong Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Key Laboratory of Intelligent Information Processing China University of Exeter United Kingdom Great Bay University China

For efficient and high-fidelity local facial attribute editing, most existing editing methods either require additional finetuning for different editing effects or tend to affect beyond the editing regions. Alternatively, inpainting methods can edit the target image region while preserving external areas. However, current inpainting methods still suffer from the generation misalignment with facial attributes description and the loss of facial skin details. To address these challenges, (i) a novel data utilization strategy is introduced to construct datasets consisting of attribute-text-image triples from a data-driven perspective, (ii) a Causality-Aware Condition Adapter is proposed to enhance the contextual causality modeling of specific details, which encodes the skin details from the original image while preventing conflicts between these cues and textual conditions. In addition, a Skin Transition Frequency Guidance technique is introduced for the local modeling of contextual causality via sampling guidance driven by low-frequency alignment. Extensive quantitative and qualitative experiments demonstrate the effectiveness of our method in boosting both fidelity and editability for localized attribute editing. The code is available at https://***/connorxian/CA-Edit. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Feature Selection Based on Consistent Granulation

SSRN

引用

SSRN 2024年

作者： Yang, Tian Shen, Shuo Deng, Jinsheng Liang, Jie Qian, Yuhua Dai, Jianhua Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Hunan Changsha410081 China College of Advanced Interdisciplinary Studies National University of Defense Technology Changsha410073 China Institute of Big Data Science and Industry Shanxi university Shanxi Taiyuan030006 China

Classifying large-scale data is a challenging task in machine learning. Feature selection and feature construction can improve the classification performances of classifiers. However, existing feature selections struggle to handle large-scale data. Granulation is the key process for generating accurate and efficient models. In this paper, we propose a novel granulation approach based on rough sets, consistent granulation, and a novel feature construction based on consistent granulation to improve the computation speed, scale, and classification performance of feature selection. As a result, the time and space complexities are reduced to a linear level in terms of sample scales. Moreover, consistent granulation can precisely represent the topological structure of the data and reduce the parameter space from [0, 1] to a finite set lowering the difficulty of optimal parameter searching. Experiments show that the proposed algorithm, FCG, outperforms four classical feature selection algorithms in handling datasets with millions of samples or tens of thousands of dimensions. Additionally, on the first thirteen datasets, FCG reduces the average runtime by 1145.68 times (NARNeMF), 883.11 times (HANDI), 1333.10 times (GBNRS), and 3.73 times (RMDPS), while increasing the average classification accuracy by 2.73% (FARNeMF), 2.30% (HANDI), 4.61% (GBNRS) and 14.33% (RMDPS) compared to these methods. © 2024, The Authors. All rights reserved.

关键词： Granulation

来源：评论

学校读者我要写书评

暂无评论

A Novel Effectiveness Assessment Framework for Neoadjuvant Chemoradiotherapy of Locally Advanced Rectal Cancer Based on Multi-modal Intelligence

A Novel Effectiveness Assessment Framework for Neoadjuvant C...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiao Tian Dong Sui Weifeng Liu Maozu Guo Gongning Luo Kuanquan Wang Beijing Key Laboratory for Intelligent Processing Methods of Architectural Big Data Beijing China School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture Beijing China Perceptual Computing Research Center Harbin Institute of Technology Harbin China

ISBN: (数字)9798350337488

ISBN: (纸本)9798350337495

Neoadjuvant chemoradiotherapy (nCRT) is the stan-dard treatment for locally advanced rectal cancer (LARC). With the development of artificial intelligence, an increasing number of studies have begun to explore its application in cancer treatment prediction. However, the prior methods exhibit considerable variability even with slight modifications to the input data, which could potentially undermine the reliability of the results. In this paper, we proposed RP-Net, a novel multi-modal fusion-based framework that combines feature information from magnetic resonance imaging (MRI) and whole slide images (WSI), establishing a relationship to map the therapeutic effectiveness of nCRT for LARC. We investigated the relationship of the tumour region and its periphery tissues, and demonstrated the validity of the proposed framework that involving 11 different combinations of modalities. The experimental results revealed that it has achieved higher prediction accuracy compared to the four intra-categories single-modal combinations and outperformed the two intra-categories multi-modal combinations. When compared to the other four inter-categories multi-modal combinations, the fusion features get accuracy of 2 % ~ 6% improvement respectively.

关键词： Protocols Magnetic resonance imaging Decision making Cancer treatment Reliability Bioinformatics Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

arXiv

引用

arXiv 2024年

作者： Deng, Kaijun Zheng, Dezhi Xie, Jindong Wang, Jinbao Xie, Weicheng Shen, Linlin Song, Siyang Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China Department of Computer Science University of Exeter United Kingdom

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code will be publicly available at https://***/CVI-SZU/DEGSTalk. Copyright © 2024, The Authors. All rights reserved.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

Improved Real-Time Post-Processing for Quantum Random Number Generators

arXiv

引用

arXiv 2023年

作者： Li, Qian Sun, Xiaoming Zhang, Xingjian Zhou, Hongyi Shenzhen lnternational Center For Industrial And Applied Mathematics Shenzhen Research Institute of Big Data Shenzhen China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Center for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University Beijing100084 China

Randomness extraction is a key problem in cryptography and theoretical computer science. With the recent rapid development of quantum cryptography, quantum-proof randomness extraction has also been widely studied, addressing the security issues in the presence of a quantum adversary. In contrast with conventional quantum-proof randomness extractors characterizing the input raw data as min-entropy sources, we find that the input raw data generated by a large class of trusted-device quantum random number generators can be characterized as the so-called reverse block source. This fact enables us to design improved extractors. Specifically, we propose two novel quantum-proof randomness extractors for reverse block sources that realize real-time block-wise extraction. In comparison with the general min-entropy randomness extractors, our designs achieve a significantly higher extraction speed and a longer output data length with the same seed length. In addition, they enjoy the property of online algorithms, which process the raw data on the fly without waiting for the entire input raw data to be available. These features make our design an adequate choice for the real-time post-processing of practical quantum random number generators. Applying our extractors to the raw data generated by a widely used quantum random number generator, we achieve a simulated extraction speed as high as 300 Gbps. Copyright © 2023, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Audio-Visual Target Speaker Extraction with Reverse Selective Auditory Attention

arXiv

引用

arXiv 2024年

作者： Tao, Ruijie Qian, Xinyuan Jiang, Yidi Li, Junjie Wang, Jiadong Li, Haizhou Department of Electrical and Computer Engineering National University of Singapore Singapore Department of Computer Science and Technology University of Science and Technology Beijing Beijing100083 China Chinese University of Hong Kong Shenzhen518172 China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big data Shenzhen518172 China Department of Electrical and Computer Engineering National University of Singapore 119077 Singapore University of Bremen 28359 Germany

Audio-visual target speaker extraction (AV-TSE) aims to extract the specific person’s speech from the audio mixture given auxiliary visual cues. Previous methods usually search for the target voice through speech-lip synchronization. However, this strategy mainly focuses on the existence of target speech, while ignoring the variations of the noise characteristics, i.e., interference speaker and the background noise. That may result in extracting noisy signals from the incorrect sound source in challenging acoustic situations. To this end, we propose a novel selective auditory attention mechanism, which can suppress interference speakers and non-speech signals to avoid incorrect speaker extraction. By estimating and utilizing the undesired noisy signal through this mechanism, we design an AV-TSE framework named Subtraction-and-ExtrAction network (SEANet) to suppress the noisy signals. We conduct abundant experiments by re-implementing three popular AV-TSE methods as the baselines and involving nine metrics for evaluation. The experimental results show that our proposed SEANet achieves state-of-the-art results and performs well for all five datasets. The code can be found in: https://***/TaoRuijie/*** © 2024, CC BY.

关键词： Background noise

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Framework for Spatial Interpolation: Merging data-driven with Domain Knowledge

arXiv

引用

arXiv 2024年

作者： Zhang, Cong Du, Shuyi Song, Hongqing Wang, Yuhe National & Local Joint Engineering Lab for Big Data Analysis and Computing Technology Beijing100190 China School of Civil and Resource Engineering University of Science and Technology Beijing Beijing100083 China Institute for Scientific Computation Texas A&M University College StationTX77843 United States

Estimating spatially distributed information through the interpolation of scattered observation datasets often overlooks the critical role of domain knowledge in understanding spatial dependencies. Additionally, the features of these datasets are typically limited to the spatial coordinates of the scattered observation locations. In this paper, we propose a hybrid framework that integrates data-driven spatial dependency feature extraction with rule-assisted spatial dependency function mapping to augment domain knowledge. We demonstrate the superior performance of our framework in two comparative application scenarios, highlighting its ability to capture more localized spatial features in the reconstructed distribution fields. Furthermore, we underscore its potential to enhance nonlinear estimation capabilities through the application of transformed fuzzy rules and to quantify the inherent uncertainties associated with the observation datasets. Our framework introduces an innovative approach to spatial information estimation by synergistically combining observational data with rule-assisted domain knowledge. © 2024, CC BY.

关键词： Domain Knowledge

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：