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

2023 International Conference on Networking and Network Applications, NaNA 2023

作者： Xu, Peng Zhao, Ziyi Ma, Sugang Xi'an Science and Technology Museum Shaanxi Xi'an710002 China School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China

ISBN: (纸本)9798350327380

In recent years, semantic segmentation methods based on deep learning have made remarkable developments. Despite achieving high segmentation accuracy, the performance of real-time segmentation methods cannot satisfy real-world applications. In order to achieve a balance between segmentation accuracy and speed, a real-time semantic segmentation algorithm based on Tversky loss function and mixed pooling is proposed in this paper. A Short-Term Dense Concatenate network (STDC network) is used to construct the encoder, and a mixed pooling module is used for the final part of the encoder, which uses strip pooling and average pooling to enhance the feature representation while expanding the receptive field. Additionally, a Tversky-based loss function is used for the detail guidance module of the backbone network in the encoder, and a joint loss function is used to supervise the whole network's training. We achieved 76.9% mIoU at 110.7 FPS on the Cityscapes dataset, a 2.4% improvement in accuracy over the benchmark algorithm STDCSeg, and 72.2% mIoU at 177.6 FPS on the Camvid dataset, satisfied the requirements of the real-time segmentation task. © 2023 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Logic-Aware Knowledge Graph Reasoning for Structural Sparsity under Large Language Model Supervision 25

Logic-Aware Knowledge Graph Reasoning for Structural Sparsit...

引用

34th ACM Web Conference, WWW 2025

作者： Pan, Yudai Hong, Jiajie Zhao, Tianzhe Song, Lingyun Liu, Jun Shang, Xuequn School of Computer Science Northwest Polytechnical University Shaanxi Xi’an China Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Shaanxi Xi’an China School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an China Research & Development Institute of Northwestern Polytechnical University in Shenzhen Shenzhen China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an China

ISBN: (纸本)9798400712746

Knowledge Graph (KG) reasoning aims to predict missing entities in incomplete triples, which requires adequate structural information to derive accurate embeddings. However, KGs in the real world are not as dense as the idealized benchmarks, where sparse graph structures restrict the comprehensive structural information for superior performance. Although the logical semantics in KGs shows its potential in alleviating the impact of structural sparsity, there still exist some challenges. The deficient supervision and the semantic gap of logic make it difficult to introduce logical semantics in sparse KG reasoning. To this end, we propose a novel KG reasoning approach LoLLM injecting logic with the supervised information supplied by the Large Language Model (LLM), which is proved to be effective in evaluating and scoring. Firstly, LoLLM derives structural embeddings employing a graph convolutional network (GCN) with relation-aware and triple-aware attention. LoLLM secondly constructs reasoning paths instantiated from the first-order logic rules extracted from sparse KGs, and injects the logical semantics by a designed LLM-enhanced tuning strategy. We propose a textual loss (TL) and a logical loss (LL) in the optimization and obtain logical tuning embeddings of KG in this process. Finally, LoLLM fuses structural embeddings from the GCN and logical tuning embeddings from the LLM-enhanced tuning for scoring and incomplete triple prediction. Extensive experiments on two sparse KGs and a benchmark show that LoLLM outperforms state-of-the-art structure-based and Language Model (LM)-augmented baselines. Moreover, the logic rules with corresponding confidences provide explicit explanations as an interpretable paradigm. © 2025 Copyright held by the owner/author(s).

关键词： Structural analysis

来源：评论

学校读者我要写书评

暂无评论

A Symbolic Rule Integration Framework with Logic Transformer for Inductive Relation Prediction 24

A Symbolic Rule Integration Framework with Logic Transformer...

引用

33rd ACM Web Conference, WWW 2024

作者： Pan, Yudai Liu, Jun Zhao, Tianzhe Zhang, Lingling Lin, Yun Dong, Jin Song School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Xi'an China National Engineering Lab for Big Data Analytics Xi'an Jiaotong University Shaanxi Xi'an China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi'an Jiaotong University Shaanxi Xi'an China Shanghai Jiao Tong University Shanghai China National University of Singapore Singapore Singapore

ISBN: (纸本)9798400701719

Relation prediction in knowledge graphs (KGs) aims at predicting missing relations in incomplete triples, whereas the dominant paradigm by KG embeddings has a limitation to predict the relation between unseen entities. This situation is called an inductive setting, which is more common in the real-world scenario. To handle this issue, implicit symbolic rules have shown great potential in capturing the inductive capability. However, it is still challenging to obtain precise representations of logic rules from KGs. The argument variability and predicate non-commutativity in symbolic rule integration make the modeling of component symbols difficult. To this end, we propose a novel inductive relation prediction model named SymRITa with a logic transformer integrating rules. SymRITa firstly extracts the subgraph, whose embeddings are captured by a graph network. Meanwhile, symbolic rule graphs in the subgraph can be generated. Then, the symbolic rules are modeled by a proposed logic transformer. Specifically, the input format based on the subgraph-based embeddings is to focus on the argument variability in symbolic rules. In addition, a conjunction attention mechanism in the logic transformer can resolve predicate non-commutativity in the symbolic rule integration process. Finally, the subgraph-based and symbol-based embeddings obtained from the previous steps are combined for the training regime, and prediction results as well as rules explaining the reasoning process are explicitly output. Extensive experiments on twelve inductive datasets show that SymRITa achieves outstanding effectiveness compared to state-of-the-art inductive baselines. Moreover, the logic rules with corresponding confidences provide an interpretable paradigm. © 2024 ACM.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Modeling of unsupervised knowledge graph of events based on mutual information among neighbor domains and sparse representation

引用

Defence technology（防务技术） 2022年第12期18卷 2150-2159页

作者： Jing-Tao Sun Jing-Ming Li Qiu-Yu Zhang School of Computer Science and Technology Xi'an University of Posts and TelecommunicationsXi'anShaanxi710121China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and TelecommunicationsXi'anShaanxi710121China School of Management Science and Engineering Anhui University of Finance and EconomicsBengbuAnhui230030China School of Computer and Communication Lanzhou University of TechnologyLanzhouGansu730050China

Text event mining,as an indispensable method of text mining processing,has attracted the extensive attention of researchers.A modeling method for knowledge graph of events based on mutual information among neighbor domains and sparse representation is proposed in this paper,***,UKGE-MS can improve the existing text mining technology's ability of understanding and discovering high-dimensional unmarked information,and solves the problems of traditional unsupervised feature selection methods,which only focus on selecting features from a global perspective and ignoring the impact of local connection of ***,considering the influence of local information of samples in feature correlation evaluation,a feature clustering algorithm based on average neighborhood mutual information is proposed,and the feature clusters with certain event correlation are obtained;Secondly,an unsupervised feature selection method based on the high-order correlation of multi-dimensional statistical data is designed by combining the dimension reduction advantage of local linear embedding algorithm and the feature selection ability of sparse representation,so as to enhance the generalization ability of the selected feature ***,the events knowledge graph is constructed by means of sparse representation and l1 *** experiments are carried out on five real datasets and synthetic datasets,and the UKGE-MS are compared with five corresponding *** experimental results show that UKGE-MS is better than the traditional method in event clustering and feature selection,and has some advantages over other methods in text event recognition and discovery.

关键词： Text event mining Knowledge graph of events Mutual information among neighbor domains Sparse representation

来源：评论

学校读者我要写书评

暂无评论

EEG-Based Fatigue Detection Using PLI Brain Network and Relief Algorithm

EEG-Based Fatigue Detection Using PLI Brain Network and Reli...

引用

2022 International Conference on Networking and Network Applications, NaNA 2022

作者： He, Yan Wang, Zhongmin Zhao, Yupeng Xi'an University of Posts and Telecommunications Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

EEG-based fatigue driving monitoring has important application value in road traffic safety, and the ultimate goal of the research is the development and use of wearable devices, and too many EEG channels in practical application scenarios is detrimental to device portability, and it will lead to problems such as large amount of data, complex calculation and long processing time, so it is especially important to study how to select the EEG channels highly correlated with fatigue. In this paper, a PLI-Relief-based channel selection algorithm by combining the PLI functional connectivity and the weighting idea of Relief algorithm is proposed, and it is applied to the channel selection of fatigue driving EEG. First, the PLI functional connectivity matrix is constructed for the EEG signals after preprocessing, and the binarized PLI matrix is mapped into a brain functional network, and the prime channels are selected by the degree property of the brain network. Then, the power spectral density features are extracted from the EEG signals of the prime channels, and the weights of each prime channel are obtained using the relief algorithm, then the number and the names of optimal channels are determined according to the recognition accuracy of different channel combinations. The proposed method was validated on the publicly available SEED-VIG dataset, and the data of the seven optimal channels is finally selected and obtains a classification accuracy of 81.25%. The framework proposed in this paper takes into account both the correlation between channels and the characteristics of the channel signals themselves in channel selection, which is a reference value for the development and application of wearable devices. © 2022 IEEE.

关键词： Wearable technology

来源：评论

学校读者我要写书评

暂无评论

Efficient QoS data Prediction Based on Tensor Kernel Paradigm-Tensor Decomposition

Efficient QoS Data Prediction Based on Tensor Kernel Paradig...

引用

International Conference on Networking and Network Applications (NaNA)

作者： Hong xia Jing Xu Qingyi Dong Hui Jia Yanping Chen Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an Shaanxi China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

In the Mobile Edge Computing (MEC) environment, the prediction efficiency is low when user recommendation is based on Quality of Service (QoS) data due to network environment and other factors. Traditional methods use Collaborative Filtering (CF) or tensor decomposition methods to mine the relationship between historical QoS data for prediction, but there are problems with prediction accuracy and efficiency. Given this, this paper proposes an efficient QoS data prediction method (CTT) combining tensor kernel paradigm-tensor decomposition. The method first introduces the tensor kernel norm to approximate the tensor rank function to better capture the spatio-temporal correlation of real QoS data; Second, tensor decomposition is combined to address inefficiencies. Experimental results on the public QoS dataset WS-Dream show that the method significantly improves the runtime while guaranteeing prediction accuracy and applies to scenarios with different data missing densities.

关键词： Tensors Accuracy Runtime Multi-access edge computing Computational modeling Quality of service Predictive models

来源：评论

学校读者我要写书评

暂无评论

Gaussian-Face: Talking Head Generation with Hybrid Density via 3D Gaussian Splatting

Gaussian-Face: Talking Head Generation with Hybrid Density v...

引用

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

作者： Guanwen Feng Yilin Zhang Yunan Li Siyu Jin Qiguang Miao School of Computer Science and Technology Xidian University Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Vision Xidian University Xi’an China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, audio-driven neural radiance field (NeRF)-based talking head generation techniques have achieved impressive results. However, these methods still have some limitations, such as unsynchronized lip movements and visual jitter. Recently, 3D Gaussian splatting has gradually replaced NeRF. Compared to NeRF, 3D Gaussian offers notable advantages, including higher efficiency and better reconstruction quality. Based on this, we propose Gaussian-Face, an audio-driven Gaussian-based facial avatar. With just a few minutes of monocular video and audio, a high-fidelity, driveable facial avatar can be reconstructed within hours. To achieve this, we first use FLAME to obtain the 3D representation of the face and then design a Lip Motion Translator to map audio to 3D lip representations. To model higher-quality facial details, we propose a hybrid density modeling method that balances rendering speed and quality, enabling our approach to render high-fidelity facial avatars at more than 160 FPS. Project page: https://***/Gaussian-Face/

关键词： Visualization Three-dimensional displays Lips Avatars Fires Rendering (computer graphics) Neural radiance field Synchronization Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

Sign-Mamba: Advanced Mamba-Based Sign Language Generation

Sign-Mamba: Advanced Mamba-Based Sign Language Generation

引用

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

作者： Guanwen Feng Yilin Zhang Yunan Li An Liu Qiguang Miao School of Computer Science and Technology Xidian University Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Vision Xidian University Xi’an China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In the field of sign language generation, Transformer-based models have been widely studied, but their quadratic computational complexity poses challenges. State Space Models (SSMs), like Mamba, offer a promising alternative with efficient long-range interaction modeling and linear complexity. In this study, we propose a two-stage generative framework for sign language generation, called Sign-Mamba, based on the state selection mechanism of SSM. In the first stage, we designed a Mamba-based encoder-decoder architecture, where the encoder captures the latent space representation and a symmetric decoder reconstructs it back into sign language skeletal points. In the second stage, the sign language latent space predicted by the Mamba-based latent predictor is used as a condition to guide the reconstruction network in generating more precise skeletal point sequences. We conducted comprehensive experiments on the PHOENIX and How2Sign datasets, and the results indicate that Sign-Mamba demonstrates competitive performance in sign language generation tasks. Project page: https://***/Sign-Mamba/

关键词： Sign language Computational modeling Semantics computer architecture Signal processing Transformers Acoustics Decoding Speech processing Computational complexity

来源：评论

学校读者我要写书评

暂无评论

KAN-Face: Efficient Resource Usage and Precision Lip-Sync in Talking Head Generation

KAN-Face: Efficient Resource Usage and Precision Lip-Sync in...

引用

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

作者： Guanwen Feng Siyu Jin Zhihao Qian Yunan Li Qiguang Miao School of Computer Science and Technology Xidian University Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Vision Xidian University Xi’an China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Despite significant progress in NeRF-based talking head generation, problems like poor lip synchronization and inefficient resource usage remain. To solve these, we propose KANFace, a lightweight framework. In preprocessing, we introduce a Lip-Sync Enhancement Module that uses Wav2Lip to extract high-resolution audio features and map them to an explicit intermediate representation, ensuring precise lip movement alignment with the speaker’s identity. These predicted lip-sync features are combined with fundamental audio-extracted lip features and injected into the rendering module to improve synchronization. For rendering, we introduce FastKAN to map spatial points to color values. As a variant of KAN, FastKAN’s sensitivity to 3D scenes and efficient structure enable precise, fast color prediction. Our framework reduces resource consumption while enhancing lip-sync accuracy and facial reconstruction, making it ideal for talking head generation tasks in resource-limited settings. Project: https://***/KAN-Face/

关键词： Accuracy Three-dimensional displays Lips Color Signal processing Rendering (computer graphics) Feature extraction Synchronization Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

QoS Prediction based on the Low-rank Autoregressive Tensor Completion

QoS Prediction based on the Low-rank Autoregressive Tensor C...

引用

2022 International Conference on Networking and Network Applications, NaNA 2022

作者： xia, Hong Dong, Qingyi Chen, Yanping Zheng, Jiahao Gao, Cong Wang, ZhongMin School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China

ISBN: (数字)9781665461313

ISBN: (纸本)9781665461313

With the rapid development of network services and edge computing, Quality of Service (QoS) has become an important indicator to validate performances of a network. Recommend high-quality services to users based on QoS values. However, the high sparsity of QoS data is because users usually call certain services only at a given time. Missing QoS data is very common in various service recommendation systems. Therefore, it is essential to predict QoS data to accurately recommend high-quality services to users. For the QoS data prediction problem, we build a third-order data tensor 'User-Service-Time' for the time series characteristics of QoS data. And introduce time-series variation as a regularization term into third-order tensor data prediction. We propose a QoS prediction framework using Low-Rank Autoregressive Tensor Completion (LATC). In particular, constructing a third-order tensor data model can better capture the global consistency of the data structure. Time regularization is introduced to take into account the local correlation of the data. Finally, in order to solve the constrained optimization problem, we use the general Alternating Direction Method of Multipliers (ADMM) to minimize the iterative optimization of variables and autoregressive parameters to obtain the final prediction result. Meanwhile, we conduct extensive research experiments on the real dataset WS-Dream. Experiments show that the QoS data prediction accuracy of our proposed QoS prediction method is higher than that of existing prediction methods under different degrees of data density. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：