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

Information Systems and Computing technology (ISCTech), International Conference on

作者： Jiangbo Huang Qingwang Wang Zifeng Zhang Sivang Liu Zhifeng Wang Tao Shen Yunnan Key Laboratory of Computer Technologies Application Kunming University of Science and Technology Kunming China School of Information Engineering and Automation Kunming University of Science and Technology Kunming China General Logistics Department of PLA Real Estate Resource Management Center Beijing China Beijing Anlu International Technology Co Beijing China

Graph Neural Networks (GNNs) based on simple graph can directly model 3D multispectral point clouds, thus avoiding the problem of 3D spatial information loss when converting 3D point clouds to 2D feature images. However, considering the dense distribution of objects in remote sensing scenes, GNNs only consider the association between pairs of vertices, which is insufficient for exploring high-order correlations and long-term dependence correlations. Hypergraph neural network (HGNN) is a more generalized framework that overcomes the limitations of traditional simple graph. In this paper, we propose a spectral-spatial fusion hypergraph convolutional network (S2FHGCN) for 3D multispectral point cloud classification. S2FHGCN first generates two hypergraphs from multidimensional features including spectral feature and spatial feature, respectively. The hypergraph structure can better handle complex high-order correlations for representation learning. Then the two hypergraphs are fused to obtain global representation information. Finally, the multidimensional features and the fused hypergraph are input to the hypergraph convolution network. The experimental results on real multispectral point clouds demonstrate the effectiveness of our proposed S2FHGCN for multispectral point cloud classification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stream Attention Based U-Net for L3DAS23 Challenge

Stream Attention Based U-Net for L3DAS23 Challenge

引用

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

作者： Honglong Wang Yanjie Fu Junjie Li Meng Ge Longbiao Wang Xinyuan Qian Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin China The Chinese University of Hong Kong Shenzhen China Huiyan Technology (Tianjin) Co. Ltd Tianjin China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

Machine learning applications of 3D audio are gaining increasing interest in recent years. In this paper, we propose a stream attention based U-Net to remove background noise and reverberation based on ICASSP Signal Processing Grand Challenge 2023: L3DAS23 Challenge 1 Audio-only track task1 3D Speech Enhancement. Results show that proposed method achieves superior performance than the official baseline model.

关键词： Adaptation models Solid modeling Three-dimensional displays Machine learning Speech enhancement Signal processing 3D audio

来源：评论

学校读者我要写书评

暂无评论

AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things

arXiv

引用

arXiv 2024年

作者： Yang, Lingxiao Dong, Xuewen Wan, Zhiguo Gao, Sheng Tong, Wei Lu, Di Shen, Yulong Du, Xiaojiang The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'An710071 China The Zhejiang Lab Hangzhou311121 China The School of Information Central University of Finance and Economics Beijing100081 China The School of Information Science and Engineering Zhejiang Sci-Tech University Hangzhou310018 China The School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi'An710071 China The School of Engineering and Science Stevens Institute of Technology Hoboken07030 United States

Sidechain techniques improve blockchain scalability and interoperability, providing decentralized exchange and cross-chain collaboration solutions for Internet of Things (IoT) data across various domains. However, current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks, hindering efficient cross-chain interactions in discontinuous networks and leading to suboptimal data exchange. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. It employs a committee to provide Cross-Blockchain as a Service (C-BaaS) for data exchange in multi-domain IoT. To fulfill the need for asynchronous and efficient data exchange, we combine the ideas of aggregate signatures and verifiable delay functions to devise a novel cryptographic primitive called delayed aggregate signature (DAS), which constructs asynchronous cross-chain proofs (ACPs) that ensure the security of cross-chain interactions. To ensure the consistency of asynchronous transactions, we propose a multilevel buffered transaction pool that guarantees the transaction sequencing. We analyze and prove the security of AsyncSC, simulate an asynchronous communication environment, and conduct a comprehensive evaluation. The results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Xiaoke Zhu Danyang Li Xiaopan Chen Fumin Qi Fan Zhang Xiao-Yuan Jing School of Computer and Information Engineering Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University Kaifeng China Department of System Operation National Supercomuting Center in Shenzhen Shenzhen China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China School of Computer Science Wuhan University Wuhan China

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Facial image based kinship verification aims to decide whether there exists kinship between the given facial images. In practice, the cross-generation differences will cause adverse effects on kinship verification, which limits the performance. Therefore, how to mine the implied similarity from facial images with large cross-generation divergence is an important problem in kinship verification, which has not yet been well studied. In view of this, we propose a Similarity Mining via Implicit matching pattern LEarning (SMILE) approach for kinship verification. Specifically, SMILE mainly consists of two modules, including a Semi-coupled Multi-pattern Similarity Learning (SMSL) module and a Cross-Generation Feature Normalization (CGFN) module. The SMSL module is designed to learn multiple semi-coupled matching patterns for mining the implicit facial similarity information from different perspectives. The CGFN module aims to reduce the divergence between facial images of parent and child. Extensive experiments demonstrate that the proposed approach outperforms the existing state-of-the-art methods.

关键词： Pattern matching Similarity learning

来源：评论

学校读者我要写书评

暂无评论

A Geometric Flow Perspective on Continuous-Depth Networks

SSRN

引用

SSRN 2024年

作者： Chen, Jun Zhu, Tianyi Liu, Lina Jiang, Yunliang Liu, Yong Zhejiang Normal University Jinhua321004 China China Mobile Research Institute Beijing100032 China Zhejiang Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal University Jinhua321004 China School of Computer Science and Technology Zhejiang Normal University Jinhua321004 China Institute of Cyber-Systems and Control Zhejiang University Hangzhou310027 China

The continuous-depth model, introduced by neural ordinary differential equations, have revived interest in exploring dynamic systems based on deep learning prototypes. The studies employed to investigate their theoretical properties mainly rely on Euclidean space, however, the geometric principle of general neural networks has been developed on the Riemannian manifold. Motivated by this open problem, we construct a formalized geometric theory of continuous-depth networks through the lens of diffeomorphic flows. From this perspective, the Riemannian metric with coordinate representations learned by the continuous-depth network itself is the closed-form solution of diffeomorphic flows. With the presence of ordinary differential equations, the continuous-depth network governs the velocity field to drive the different kinds of data apart from each other, which is a novel observation between the velocity field and data separation. Toy experiments confirm the proposed theory, as well as provide intuitions and visualizations as to how the velocity field governed by continuous-depth networks evolves on the manifold to operate on data. © 2024, The Authors. All rights reserved.

关键词： Ordinary differential equations

来源：评论

学校读者我要写书评

暂无评论

Three-Channel Graph Convolutional Network

Three-Channel Graph Convolutional Network

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Lei Meng Zhonglin Ye Haixing Zhao Yanlin Yang Yang Chen Zhaoyang Wang The State Key Laboratory of Tibetan Intelligent Information Processing and Application College of Computer Qinghai Normal University Tibetan Information Processing Engineering Technology and Research Center of Qinghai Province Xining China

At present, as an emerging direction of artificial intelligence, graph neural networks (GNNs) have developed rapidly and can solve many graph data problems efficiently. The real world is composed of a large number of networks. Compared with the widely studied single-relationship feature information networks, the real-world networks are mostly composed of multi-relationship feature information networks in which different types of objects are interconnected through complex relationships. Complex structural information and rich semantic information are included by multi-relationship feature information networks, thereby the real network can be restored more realistically. However, one type of relational feature of the network is merely considered by most of the existing GNNs, and the information of multi-relationship features and the hidden information between multi-relationship features are ignored in the network. In order to deal with these restrictions, a novel graph convolutional network (TCGCN) based on an attention mechanism is proposed, which aims to extract different relational features in multi-relationship feature networks and the hidden information between them more comprehensively, thereby improving the performance of GNNs in downstream tasks. In this paper, an improved attention mechanism is used to aggregate different types of single relational features, and the aggregated multiple single relational feature network information is fused with the mixed relational feature network information into the final node representation. The proposed TCGCN outperforms most other methods in extensive experiments conducted on three real-world datasets.

关键词： Smart cities Aggregates Semantics Feature extraction Graph neural networks Convolutional neural networks Data mining

来源：评论

学校读者我要写书评

暂无评论

ZuantuSet: A Collection of Historical Chinese Visualizations and Illustrations

arXiv

引用

arXiv 2025年

作者： Mei, Xiyao Zhang, Yu Yang, Chaofan Shi, Rui Yuan, Xiaoru National Key Laboratory of General Artificial Intelligence School of Intelligence Science and Technology Peking University Beijing China Department of Computer Science University of Oxford Oxford United Kingdom Center for Research on Ancient Chinese History Peking University Beijing China National Engineering Laboratory for Big Data Analysis and Application Peking University Beijing China PKU-WUHAN Institute for Artificial Intelligence Wuhan China

Historical visualizations are a valuable resource for studying the history of visualization and inspecting the cultural context where they were created. When investigating historical visualizations, it is essential to consider contributions from different cultural frameworks to gain a comprehensive understanding. While there is extensive research on historical visualizations within the European cultural framework, this work shifts the focus to ancient China, a cultural context that remains underexplored by visualization researchers. To this aim, we propose a semi-automatic pipeline to collect, extract, and label historical Chinese visualizations. Through the pipeline, we curate ZuantuSet, a dataset with over 71K visualizations and 108K illustrations. We analyze distinctive design patterns of historical Chinese visualizations and their potential causes within the context of Chinese history and culture. We illustrate potential usage scenarios for this dataset, summarize the unique challenges and solutions associated with collecting historical Chinese visualizations, and outline future research directions. Copyright © 2025, The Authors. All rights reserved.

关键词： Data collection

来源：评论

学校读者我要写书评

暂无评论

Discrete Jaya algorithm to solve the police resource deployment problem in emergency traffic accident 10

Discrete Jaya algorithm to solve the police resource deploym...

引用

10th IEEE Joint International Information technology and Artificial Intelligence Conference, ITAIC 2022

作者： Jing, Zhang Weijie, Ding Zhejiang Police College Department of Computer and Information Security Hangzhou310053 China Big-data and Network Security Research Institute Zhejiang Police College Hangzhou310053 China College of Information Engineering Zhejiang University of Technology Hangzhou310023 China Key Laboratory of Public Security Information Application Based on Big-data Architecture Ministry of Public Security Hangzhou310053 China

ISBN: (数字)9781665422079

ISBN: (纸本)9781665422079

Aiming at the high frequency of urban traffic accidents and the relative shortage of police resources, a multi-objective discrete Jaya algorithm is proposed to solve the problem of police resource deployment in emergency traffic accident handling. The purpose is to make timely response and handling of traffic accidents through the rational allocation of police deployment points in the jurisdiction. Taking the coverage of accident points and the average response time of accidents as the optimization objectives, the discrete Jaya algorithm is used as the global search strategy to approach the Pareto front by constantly approaching the optimal solution and far away from the worst solution, and then the neighborhood search strategy is used to improve the local search ability of the algorithm. Finally, a practical example is given to verify the effectiveness of the proposed method. © 2022 IEEE.

关键词： Law enforcement

来源：评论

学校读者我要写书评

暂无评论

Dependency and Association Enhanced Finding Similar Exercises in Online Education System

Dependency and Association Enhanced Finding Similar Exercise...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Zihang Tang Hao Wang Weibo Gao Zhenya Huang Qi Liu Jun Yu School of Data Science University of Science and Technology of China Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China iFLYTEK Research iFLYTEK CO. LTD.

ISBN: (纸本)9781665456579

Finding Similar Exercises (FSE) is a tough nut to crack in online education systems, especially among large scale exercise corpus. Given exercises with associated attributes, contents (texts and images) and knowledge concepts, most solutions learn exercise representations in isolation, where only contents or concepts are exploited. Though a few works try to combine concept-exercise associations for capturing long-range similarity among exercises, they just utilize a single relation among concepts but neglect the multiple dependencies. In this paper, we propose a novel Dependency and Association enhanced Finding Similar Exercises framework, namely DAFSE, which can consider both the concept-exercise associations and the multiple dependency relations among concepts, simultaneously. Specifically, we first build a concept-exercise-content multi-layer graph and embed each concept, exercise and content node through an Embedding Layer. Then we introduce Attentive Combination Layer to effectively preserve the long-range similarity as well as rich domain knowledge to exercise representations by propagating on the multi-layer graph. Finally, we use a Similarity Score Layer to assess the similarity of exercise pairs. Extensive experiments on real-world datasets demonstrate the effectiveness of DAFSE.

关键词： Cloud computing Computational modeling Education Collaboration Labeling Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

Investigation of Using Large-Scale Swarm Optimizers to Optimize Sub-Problems in Cooperative Co-Evolution

Investigation of Using Large-Scale Swarm Optimizers to Optim...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Ming-Yuan Lu Qiang Yang Dong Liu Yuan-Yuan Ma Tao Li Jun Zhang College of Computer and Information Engineering Henan Normal University Xinxiang China Key Laboratory of Artificial Intelligence and Personalized Learning in Education of Henan Province Xinxiang China School of Artificial Intelligence Nanjing University of Information Science and Technology Nanjing China Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Normal University Jinhua China Department of Electrical and Electronic Engineering Hanyang University Ansan Korea

Cooperative co-evolutionary algorithms (CCEAs) have witnessed giant success in solving large-scale optimization problems (LSOPs). However, most existing CCEAs use low-dimensional EAs to optimize the decomposed sub-problems. Such utilization of low-dimensional EAs may limit the effectiveness of CCEAs because some of the decomposed sub-problems may still be high-dimensional. Since there exist many non-decomposition based large-scale EAs, it is interesting to investigate the optimization effectiveness of CCEAs by using these non-decomposition based large-scale EAs to solve the decomposed sub-problems. To this end, this paper incorporates two state-of-the-art large-scale swarm optimizers into CCEAs with five state-of-the-art decomposition strategies to solve LSOPs. Experiments conducted on the CEC'2010 and CEC'2013 LSOP benchmark sets have shown that the two large-scale swarm optimizers help CCEAs with the five decomposition strategies achieve much better performance than the most widely used low-dimensional EA.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：