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

2022 International Conference on networking and network Applications, NaNA 2022

作者： Meng, Haining Zhang, Jiawei Zheng, Yi Ji, Wenjiang Tong, Xinyu Hei, Xinhong School of Computer Science and Engineering Xi'an University of Technology Xi'an China Shaanxi Key Lab Network Computer and Security Technology Xi'an China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

The long-term operation of high-speed railway will lead to track irregularity that will cause random vibration of the track system and affect driving safety. The accurate prediction of track irregularity is of great significance to the quality of high-speed railway. In this paper, we proposed a DWT-DLSTM model to predict the track irregularity for high-speed railway. Firstly, the track irregularity time series data is denoised through the discrete wavelet transform (DWT). Then the deep long short-term memory (DLSTM) neural network is adopted to predict the denoised data. Finally, the experiment results show that the proposed DWT-DLSTM model outperforms other traditional models and obtain more accurate prediction results for track irregularity. © 2022 IEEE.

关键词： Discrete wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

DSDIR: A Two-Stage Method for Addressing Noisy Long-Tailed Problems in Malicious Traffic Detection

DSDIR: A Two-Stage Method for Addressing Noisy Long-Tailed P...

引用

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

作者： Guoliang Li Ruiqi Zhang Zhe Sun Lingkai Xing Yu Zhang College of Cyber Science Nankai University China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education China College of Computer Science Nankai University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, deep learning based malicious traffic detection (MTD) systems have demonstrated remarkable success. However, their effectiveness tend to decrease because most malicious traffic datasets are suffered from noisy-labeled and long-tailed problems. While numerous approaches have been developed to address these two problems individually, they become inefficient when confronting the combined challenge of noisy long-tailed data, as they typically tackle only a single adverse factor at a time. This paper proposes a two-stage method called Distribution-aware sample Selection and Dynamic Instance-based Relabeling (DSDIR), which simultaneously addresses the impacts of noisy-labeled and long-tailed problems. In the first stage, a noise-independent clean sample selection method is designed to obtain a clean dataset, which converts negative effects of the long-tailed problem into positive ones. In the second stage, dynamic instance-based relabeling is designed to train a model and improve the dataset’s quality simultaneously. Eventually, DSDIR not only produces a balanced and noise-tolerant model but also obtains a clean dataset. Experimental results demonstrate that in the high noise condition of 60% and 80%, the accuracy rate of DSDIR is 5% higher than the state-of-the-art methods. Our code is available at https://***/nku-ligl/DSDIR.

关键词： Deep learning Computer vision Heavily-tailed distribution Codes Accuracy Noise Speech recognition Acoustics Noise measurement Speech processing

来源：评论

学校读者我要写书评

暂无评论

Iterative Utility Judgment Framework via LLMs Inspired by Relevance in Philosophy

arXiv

引用

arXiv 2024年

作者： Zhang, Hengran Bi, Keping Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China

Utility and topical relevance are critical measures in information retrieval (IR), reflecting system and user perspectives, respectively. While topical relevance has long been emphasized, utility is a higher standard of relevance and is more useful for facilitating downstream tasks, e.g., in Retrieval-Augmented Generation (RAG). When we incorporate utility judgments into RAG, we realize that the topical relevance, utility, and answering in RAG are closely related to the three types of relevance that Schutz discussed from a philosophical perspective. They are topical relevance, interpretational relevance, and motivational relevance, respectively. Inspired by the dynamic iterations of the three types of relevance, we propose an Iterative utiliTy judgmEnt fraMework (ITEM) to promote each step of the cycle of RAG. We conducted extensive experiments on multigrade passage retrieval and factoid questionanswering datasets (i.e., TREC DL, WebAP, and NQ). Experimental results demonstrate significant improvements in utility judgments, ranking of topical relevance, and answer generation upon representative baselines, including multiple single-shot utility judging approaches. Our code and benchmark can be found at https://anonymous.4open. science/r/ITEM-B486/. Copyright © 2024, The Authors. All rights reserved.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Multimodal Biological Knowledge Graph Completion via Triple Co-Attention Mechanism 39

Multimodal Biological Knowledge Graph Completion via Triple ...

引用

39th IEEE International Conference on data Engineering, ICDE 2023

作者： Xu, Derong Zhou, Jingbo Xu, Tong Xia, Yuan Liu, Ji Chen, Enhong Dou, Dejing University of Science and Technology of China State Key Laboratory of Cognitive Intelligence China Baidu Research Business Intelligence Lab Baidu Intelligent Healthcare Unit Baidu Research Big Data Lab BCG X

ISBN: (纸本)9798350322279

Biological Knowledge Graphs (BKGs) can help to model complex biological systems in a structural way to support various tasks. Nevertheless, the incompleteness problem may limit the performance of existing BKGs, which still deserves new methods to reveal the missing relations. Though great efforts have been made to knowledge graph completion, existing methods are not easy to be adapted to the multimodal biological information such as molecular structures and textual descriptions. To this end, we propose a novel co-attention-based multimodal embedding framework, named CamE, for the multimodal BKG completion task. Specifically, we design a Triple Co-Attention (TCA) operator to capture and highlight the same semantic features among different modalities. Based on TCA, we further propose two components to handle multimodal fusion and multimodal entity-relation interaction, respectively. One is the multimodal TCA fusion module to achieve a multimodal joint representation for each entity in the BKG. It aims to project different modal information into a common space by capturing the same semantic features and overcoming the modality gap. The other is the relation-aware interactive TCA module to learn interactive representation by modelling the deep interaction between multimodal entities and relations. Extensive experiments on two real-world multimodal BKG datasets demonstrate that our method significantly outperforms several state-of-the-art baselines, including 10.3% and 16.2% improvement w.r.t MRR and Hits@1 metrics over its best competitors on public DRKG-MM dataset. © 2023 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

AMTrans:Auto-Correlation Multi-Head Attention Transformer for Infrared Spectral Deconvolution

引用

清华大学学报自然科学版（英文版） 2025年第3期30卷 1329-1341页

作者： Lei Gao Liyuan Cui Shuwen Chen Lizhen Deng Xiaokang Wang Xiaohong Yan Hu Zhu College of Electronic and Optical Engineering & College of Flexible Electronics(Future Technology) Nanjing University of Posts and TelecommunicationsNanjing 210003China Jiangsu Province Key Lab on Image Processing and Image Communication Nanjing University of Posts and TelecommunicationsNanjing 210003China National Engineering Research Center of Communication and Network Technology Nanjing University of Posts and TelecommunicationsNanjing 210003China School of Computer Science and Technology Hainan UniversityHaikou 570228China

Infrared spectroscopy analysis has found widespread applications in various fields due to advancements in technology and industry *** improve the quality and reliability of infrared spectroscopy signals,deconvolution is a crucial preprocessing *** by the transformer model,we propose an Auto-correlation Multi-head attention Transformer(AMTrans)for infrared spectrum sequence *** auto-correlation attention model improves the scaled dot-product attention in the *** utilizes attention mechanism for feature extraction and implements attention computation using the auto-correlation *** auto-correlation attention model is used to exploit the inherent sequence nature of spectral data and to effectively recovery spectra by capturing auto-correlation patterns in the *** proposed model is trained using supervised learning and demonstrates promising results in infrared spectroscopic *** comparing the experiments with other deconvolution techniques,the experimental results show that the method has excellent deconvolution performance and can effectively recover the texture details of the infrared spectrum.

关键词： spectroscopy spectral deconvolution transformer auto-correlation mechanism

来源：评论

学校读者我要写书评

暂无评论

MOLECULE GENERATION FOR TARGET PROTEIN BINDING WITH STRUCTURAL MOTIFS 11

MOLECULE GENERATION FOR TARGET PROTEIN BINDING WITH STRUCTUR...

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Zhang, Zaixi Min, Yaosen Zheng, Shuxin Liu, Qi Anhui Province Key Lab of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence Anhui Hefei China Institute of Interdisciplinary Information Sciences Tsinghua University China Microsoft Research United States

Designing ligand molecules that bind to specific protein binding sites is a fundamental problem in structure-based drug design. Although deep generative models and geometric deep learning have made great progress in drug design, existing works either sample in the 2D graph space or fail to generate valid molecules with realistic substructures. To tackle these problems, we propose a Fragment-based LigAnd Generation framework (FLAG), to generate 3D molecules with valid and realistic substructures fragment-by-fragment. In FLAG, a motif vocabulary is constructed by extracting common molecular fragments (i.e., motif) in the dataset. At each generation step, a 3D graph neural network is first employed to encode the intermediate context information. Then, our model selects the focal motif, predicts the next motif type, and attaches the new motif. The bond lengths/angles can be quickly and accurately determined by cheminformatics tools. Finally, the molecular geometry is further adjusted according to the predicted rotation angle and the structure refinement. Our model not only achieves competitive performances on conventional metrics such as binding affinity, QED, and SA, but also outperforms baselines by a large margin in generating molecules with realistic substructures. Our code is publicly available at https://***/zaixizhang/FLAG. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Understanding User Passwords through Parsing Tree

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Wang, Ding Shan, Xuan Wu, Yuxuan Jia, Chunfu Nankai University College of Cryptology and Cyber Science Tianjin300350 China Ministry of Education of China Henan Key Laboratory of Network Cryptography Key Laboratory of Cyberspace Security China Nankai University Tianjin Key Laboratory of Network and Data Security Technology Tianjin300350 China

Passwords are today's dominant form of authentication, and password guessing is the most effective method for evaluating password strength. Most password guessing models (e.g., PCFG, Markov, and RFGuess) regard passwords as sequences composed of basic units (i.e., characters/segments), with the information flow being unidirectional (i.e., predicting the next unit based on the preceding units). However, modeling passwords in a single direction fails to capture users' password creation behavior that is actually impacted by the full password context. Through an in-depth analysis of real-world passwords, we reveal that users often create passwords around a central keyword, like common words, names, or dates, and then embellish them with numbers or symbols. Based on this observation, we, for the first time, attempt to parse passwords as trees. Unlike existing sequence models, trees can reveal the semantic connections within passwords and the logical thought processes users follow when creating passwords. For instance, in the password iloveyou, the basic units i and you are semantically dependent on the predicate love, forming a natural tree structure. We propose a trawling guessing model called PassTree and a targeted guessing model based on personally identifiable information (PII), named PassTree-PII. Our extensive experiments demonstrate the effectiveness of our models: (1) PassTree outperforms its leading counterparts by 0.38%-2.51% when guessing numbers are below 107 (2) PassTree-PII achieves a cracking rate comparable to the state-of-the-art RFGuess-PII proposed in USENIX Security'23, but operates significantly more efficiently, using only 0.87% of the memory and being 16.60 times faster. Our work provides a new perspective on understanding user passwords and demonstrates a feasible technical route of applying tree structures to password guessing. © 2025 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Research on long and short-term social recommendation based on convolutional and gated recurrent units 29

Research on long and short-term social recommendation based ...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Jia, Zihe Xue, Peng Dai, Zhiqiang Gao, Qian Zhang, Xiaomeng Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China

ISBN: (纸本)9798350330717

The development of the Internet has made people more closely related and has put forward higher requirements for recommendation models. Most recommendation models are studied only for the long-term interests of users. In this paper, the interaction time between the user and the item is introduced as auxiliary information in the model construction. Interaction time is used to determine users' long-term preferences and short-term preferences. In this paper, temporal features are extracted by building a convolutional gated recurrent unit with attention neural network (CNN-GRU-Attention). Firstly, for the problem of accurate feature extraction, CNN are constructed to extract higher-level and more abstract features of themselves and transform high-dimensional data into low-dimensional data;secondly, for the problem of social temporality, GRU are used to not only extract temporal information, but also effectively reduce gradient dispersion, making model convergence and training easier;finally, Graph Attention networks are used to aggregate the social relationship information of users and items respectively, which constitute the final feature representation of users and items respectively. In particular, a modified cosine similarity is used to reduce the error caused by data insensitivity when constructing the social information of the item. In this study, simulation experiments are conducted on two publicly available datasets (Epinions and Ciao), and the experimental results show that the proposed recommended model performs better than other social recommendation models, improving the evaluation metrics of MAE and RMSE by 1.06%-1.33% and 1.19%-1.37%, respectively. The effectiveness of the model innovation is proved. © 2023 IEEE.

关键词： convolutional gated recurrent unit graph attention networks neighborhood recommendation systems social networks

来源：评论

学校读者我要写书评

暂无评论

On the MDS Condition of Generalized Expanded-Blaum-Roth Codes 18

On the MDS Condition of Generalized Expanded-Blaum-Roth Code...

引用

18th International Symposium on Problems of Redundancy in Information and Control Systems, REDUNDANCY 2023

作者： Hou, Hanxu Song, Linqi Dongguan University of Technology Dongguan Key Lab of Artificial Information Network School of Electrical Engineering & Intelligentization China City University of Hong Kong Department of Computer Science Hong Kong

ISBN: (纸本)9798350381528

Generalized Expanded-Blaum-Roth (GEBR) codes [You et al. 2020] are designed for large-scale distributed storage systems that have larger recoverability for single-symbol failures, multi-column failures and multi-row failures, compared with locally recoverable codes (LRC). GEBR codes encode an α × k information array into a pτ ×(k + r) array such that lines of slope i with 0 ≤ i ≤ r -1 have even parity and each column contains pτ-α local parity symbols, where p is an odd prime and k +r ≤ pτ. Necessary and sufficient conditions for GEBR codes to be (n, k) recoverable (i.e., any k out of n = k+r columns can retrieve all information symbols) are given in [Hou et al. 2023] for α = (p -1)τ. However, the (n, k) recoverable condition of GEBR codes is unknown when α © 2023 IEEE.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Riemannian Complex Hermit Positive Definite Convolution network for Polarimetric SAR Image Classification

arXiv

引用

arXiv 2025年

作者： Shi, Junfei Nie, Mengmeng Li, Yuke Jin, Haiyan Lin, Weisi Department of Computer Science and Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an University of Technology Xi’an China College of Computing and Data Science Nanyang Technological University 639798 Singapore

Deep learning can learn high-level semantic features in Euclidean space effectively for PolSAR images, while they need to covert the complex covariance matrix into a feature vector or complex-valued vector as the network input. However, the complex covariance matrices are essentially a complex Hermit positive definite (HPD) matrix endowed in Riemannian manifold rather than Euclidean space. The matrix’s real and imagery parts are with the same significance, as the imagery part represents the phase information. The matrix vectorization will destroy the geometric structure and manifold characteristics of complex covariance matrices. To learn complex HPD matrices directly, we propose a Riemannian complex HPD convolution network(HPD CNN) for PolSAR images. This method consists of a complex HPD unfolding network(HPDnet) and a CV-3DCNN enhanced network. The proposed complex HPDnet defines the HPD mapping, rectifying and the logEig layers to learn geometric features of complex matrices. In addition, a fast eigenvalue decomposition method is designed to reduce computation burden. Finally, a Riemannian-to-Euclidean enhanced network is defined to enhance contextual information for classification. Experimental results on two real PolSSAR datasets demonstrate the proposed method can achieve superior performance than the state-of-the-art methods especially in heterogeneous regions. Copyright © 2025, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：