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

26th International Conference on computer Supported Cooperative Work in Design, CSCWD 2023

作者： Huo, Jinchen Liu, Weidong Li, Yang Cao, Yan Institute of Scientific and Technical Information of China China College of Computer Science Inner Mongolia University China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

ISBN: (纸本)9798350331684

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation via Fischer-Burmeister Total Variation and Thresholding

引用

Advances in Applied Mathematics and Mechanics 2022年第4期14卷 960-988页

作者： TingtingWu Yichen Zhao Zhihui Mao Li Shi Zhi Li Yonghua Zeng School of Science Nanjing University of Posts and TelecommunicationsNanjingJiangsu 210023China The Department of Computer Science and Technology Shanghai Key Laboratory of Multidimensional Information ProcessingEast China Normal UniversityShanghai 200241China College of Field Engineering PLA Army Engineering UniversityNanjingJianhsu 210007China

Image segmentation is a significant problem in image *** this paper,we propose a new two-stage scheme for segmentation based on the Fischer-Burmeister total variation(FBTV).The first stage of our method is to calculate a smooth solution from the FBTV Mumford-Shah ***,we design a new difference of convex algorithm(DCA)with the semi-proximal alternating direction method of multipliers(sPADMM)*** the second stage,we make use of the smooth solution and the K-means method to obtain the segmentation *** simulate images more accurately,a useful operator is introduced,which enables the proposed model to segment not only the noisy or blurry images but the images with missing pixels *** demonstrate the proposed method produces more preferable results comparing with some state-of-the-art methods,especially on the images with missing pixels.

关键词： Image segmentation Fischer-Burmeister total variation difference of convex algorithm sPADMM K-means method.

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-enhanced Dual Semi-supervised Graph Classification 41

Hypergraph-enhanced Dual Semi-supervised Graph Classificatio...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Ju, Wei Mao, Zhengyang Yi, Siyu Qin, Yifang Gu, Yiyang Xiao, Zhiping Wang, Yifan Luo, Xiao Zhang, Ming School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University-Anker Embodied AI Lab Peking University China School of Statistics and Data Science Nankai University China Department of Computer Science University of California Los Angeles United States School of Information Technology & Management University of International Business and Economics China

In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising capability of graph neural networks (GNNs), they typically require a large number of costly labeled graphs, while a wealth of unlabeled graphs fail to be effectively utilized. Moreover, GNNs are inherently limited to encoding local neighborhood information using message-passing mechanisms, thus lacking the ability to model higher-order dependencies among nodes. To tackle these challenges, we propose a Hypergraph-Enhanced DuAL framework named HEAL for semi-supervised graph classification, which captures graph semantics from the perspective of the hypergraph and the line graph, respectively. Specifically, to better explore the higher-order relationships among nodes, we design a hypergraph structure learning to adaptively learn complex node dependencies beyond pairwise relations. Meanwhile, based on the learned hypergraph, we introduce a line graph to capture the interaction between hyperedges, thereby better mining the underlying semantic structures. Finally, we develop a relational consistency learning to facilitate knowledge transfer between the two branches and provide better mutual guidance. Extensive experiments on real-world graph datasets verify the effectiveness of the proposed method against existing state-of-the-art methods. Copyright 2024 by the author(s)

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Robust restoration of low-dose cerebral perfusion CT images using NCS-Unet

引用

Nuclear Science and Techniques 2022年第3期33卷 62-76页

作者： Kai Chen Li-Bo Zhang Jia-Shun Liu Yuan Gao Zhan Wu Hai-Chen Zhu Chang-Ping Du Xiao-Li Mai Chun-Feng Yang Yang Chen Southeast University Nanjing 210096China School of Cyber Science and Engineering Southeast UniversityNanjing 210096China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationNanjing 210096China Department of Radiology General Hospital of the Northern Theater of the Chinese People’s Liberation ArmyShenyang 110016China Laboratory of Image Science and Technology The School of Computer Science and EngineeringSoutheast UniversityNanjing 210096China Department of Radiology Nanjing Drum Tower HospitalThe Affiliated Hospital of Nanjing University Medical SchoolNanjing 210008China Jiangsu Key Laboratory of Molecular and Functional Imaging Department of RadiologyZhongda HospitalSoutheast UniversityNanjing 210009China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and EngineeringSoutheast UniversityNanjing 210096China

Cerebral perfusion computed tomography(PCT)is an important imaging modality for evaluating cerebrovascular diseases and stroke *** widespread public concern about the potential cancer risks and health hazards associated with cumulative radiation exposure in PCT imaging,considerable research has been conducted to reduce the radiation dose in X-ray-based brain perfusion *** the dose of X-rays causes severe noise and artifacts in PCT *** solve this problem,we propose a deep learning method called *** exceptional characteristics of non-subsampled contourlet transform(NSCT)and the Sobel filter are introduced into *** decomposes the convolved features into high-and low-frequency *** decomposed high-frequency component retains image edges,contrast imaging traces,and noise,whereas the low-frequency component retains the main image *** Sobel filter extracts the contours of the original image and the imaging traces caused by the contrast agent *** extracted information is added to NCS-Unet to improve its performance in noise reduction and artifact *** and quantitative analyses demonstrated that the proposed NCS-Unet can improve the quality of low-dose cone-beam CT perfusion reconstruction images and the accuracy of perfusion parameter calculations.

关键词： Cerebral perfusion CT Low-dose Image denoising Perfusion parameters

来源：评论

学校读者我要写书评

暂无评论

On-chip terahertz orbital angular momentum demultiplexer

引用

Photonics Research 2024年第5期12卷 1044-1054页

作者： XIAOHAN JIANG WANYING LIU QUAN XU YUANHAO LANG YIKAI FU FAN HUANG HAITAO DAI YANFENG LI XUEQIAN ZHANG JIANQIANG GU JIAGUANG HAN WEILI ZHANG Center for Terahertz Waves College of Precision Instrument and Optoelectronics Engineeringand Key Laboratory of Optoelectronics Information and Technology(Ministry of Education)Tianjin UniversityTianjin 300072China Tianjin Key Laboratory of Low Dimensional Materials Physics and Preparing Technology School of ScienceTianjin UniversityTianjin 300072China Guangxi Key Laboratory of Optoelectronic Information Processing School of Optoelectronic EngineeringGuilin University of Electronic TechnologyGuilin 541004China School of Electrical and Computer Engineering Oklahoma State UniversityStillwaterOklahoma 74078USA

The terahertz regime is widely recognized as a fundamental domain with significant potential to address the demands of next-generation wireless *** parallel,mode division multiplexing based on orbital angular momentum(OAM)shows promise in enhancing bandwidth utilization,thereby expanding the overall communication channel *** this study,we present both theoretical and experimental demonstrations of an on-chip terahertz OAM *** device effectively couples and steers seven incident terahertz vortex beams into distinct high-quality focusing surface plasmonic beams,and the focusing directions can be arbitrarily *** proposed design strategy integrates space-to-chip mode conversion,OAM recognition,and on-chip routing in a compact space with subwavelength thickness,exhibiting versatility and superior performance.

关键词： demultiplexer momentum angular

来源：评论

学校读者我要写书评

暂无评论

Variational Clustering and Denoising of Spatial Transcriptomics

Variational Clustering and Denoising of Spatial Transcriptom...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Li, Cuiyuan Zhang, Fa Hu, Kai Cui, Xuefeng Shandong University School of Computer Science and Technology Qingdao China Beijing Institute of Technology School of Medical Technology Beijing China Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan China Xiangnan University Key Laboratory of Medical Imaging and Artificial Intelligence of Hunan Province Chenzhou China

ISBN: (纸本)9798350337488

Spatial transcriptomics data provides a unique opportunity to investigate both gene expression and spatial structure in tissues at the same time. However, incorporating spatial information to accurately identify spatial domains is difficult due to factors such as high-dimensionality, sparsity, noise, and dropout events. To address these issues, we introduce vGraphST, a novel graph-based deep learning approach tailored for spatial transcriptomics data. Our method combines auto-encoder and contrastive learning techniques to process high-dimensional data and generate meaningful low-dimensional embeddings. Additionally, we use continuous distributions instead of discrete values in both the latent space and the denoised gene expression space. Specifically, Gaussian distributions are used to model the latent space, while zero-inflated Poisson distributions are used to model the denoised gene expression space. Experimental results demonstrate the effectiveness of vGraphST in accurately representing and analyzing spatial transcriptomics data. When compared to other methods using the DLPFC dataset, vGraphST achieves an average Adjusted Rand Index (ARI) of 0.58, demonstrating its superiority in segmenting spatial domains and recognizing biologically relevant spatiotemporal patterns. © 2023 IEEE.

关键词： clustering contrastive learning denoising spatial transcriptomics variational auto-encoder

来源：评论

学校读者我要写书评

暂无评论

Research on low energy task allocation and scheduling algorithm based on imprecise heterogeneous multi-core technology

Research on low energy task allocation and scheduling algori...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Gu, Haonan Wu, Jing Hu, Wei Ma, Tianao Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

In heterogeneous embedded systems, we try to find a new non real-time scheduling algorithm, which can not only meet the reliability requirements, but also achieve low energy consumption. 'Resource reservation time deterministic cyclic scheduling (RRTDCS)' algorithm is a kind of scheduling for offline cache pre-allocation. This scheduling algorithm combines time reservation and priority strategy. The algorithm can dynamically adjust according to different task sets. It can also adjust its own scheduling process to adapt to different scheduling environments. The periodic cyclic strategy enables low power consumption in task allocation. In the experimental part, we compared the algorithm proposed in this paper with the current mainstream real-time scheduling scheme. Experimental results show that RRTDCS algorithm has better performance. © 2022 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Enhanced fireworks algorithm based on particle swarm optimization and reverse learning of small-hole imaging experiment

Enhanced fireworks algorithm based on particle swarm optimiz...

引用

2022 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2022

作者： Jiao, Jiao Li, Jun Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System College of Computer Science and Technology Wuhan China

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

Since the traditional fireworks algorithm (FWA) is easy to fall into local optimization and has insufficient global optimization capability and low optimization accuracy, this paper proposes the enhanced fireworks algorithm (EFWA-SI) based on particle swarm optimization and small-hole imaging reverse learning. First, a dynamic explosion amplitude mechanism based on the evolution speed of the population is designed. The evolution speed of the population is dynamically adjusted by evaluating the evolution speed of the fitness in each iteration process, and the global and local search information is controlled. Secondly, the small-hole imaging reverse learning strategy combined with the idea of optimal-worst reverse learning is proposed. This strategy increases the diversity of the optimal-seeking positions and improves the ability of the algorithm to jump out of the local optimum;Finally, the current position is updated according to the position and speed of each firework, and the globally optimal fireworks and personally optimal fireworks are updated simultaneously to improve the individual heuristic learning ability. Through the simulation experiments on the CEC2015 test function and comparison with related algorithms, the results show that the algorithm performs better in convergence speed, computational accuracy, and stability. © 2022 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

LE-CAM++: A Lighter and More Efficient CAM++ for Speaker Verification 14

LE-CAM++: A Lighter and More Efficient CAM++ for Speaker Ver...

引用

14th International Symposium on Chinese Spoken Language processing, ISCSLP 2024

作者： Liu, Shuanghong Song, Zhida Fang, Zhihua He, Liang School of Computer Science and Technology Xinjiang University Urumqi China School of Intelligence Science and Technology Xinjiang University Urumqi China Xinjiang Key Laboratory of Signal Detection and Processing Urumqi China Department of Electronic Engineering Beijing National Research Center for Information Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9798331516826

Due to its superior performance and fewer parameters, CAM++ has become the state-of-the-art model for speaker verification tasks. This model uses 2D convolutional blocks to extract front-end features, which are then fed into a densely connected time-delay neural network backbone to extract deep features. However, the simple stacking of 2D convolutions may lead to the generation of a significant amount of redundant features, which is detrimental to efficient feature extraction. Furthermore, although CAM++ already has a relatively small number of parameters, there is still room for further optimization. To address these issues, this paper first employs depthwise separable convolutions to replace the dilated convolutions in the backend network of CAM++, making the model more lightweight. Next, we introduce spatial and channel reconstruction convolution (SCConv) in the ResBlock module of CAM++ to reduce redundant features and optimize the feature extraction process. Finally, after SCConv, we apply squeeze and excitation attention mechanism to model the interdependencies between channels and recalibrate each channel, further enhancing the model’s representational capacity. We name the resulting model LE-CAM++. Our proposed model achieves an EER of 0.686 and a minDCF of 0.084 on the VoxCeleb1-O dataset. Compared to the baseline model CAM++, the EER is reduced by 11%, and the minDCF is reduced by 28%. Additionally, the model parameters are reduced by 8%. ©2024 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Graph Segmentation and Contrastive Enhanced Explainer for Graph Neural Networks 39

Graph Segmentation and Contrastive Enhanced Explainer for Gr...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Zhiqiang Guo, Jiayu Liang, Jianqing Liang, Jiye Cheng, Shiying Zhang, Jiarong Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education School of Computer and Information Technology Shanxi University Shanxi Taiyuan 030006 China

ISBN: (纸本)157735897X

Graph Neural Networks are powerful tools for modeling graph-structured data but their interpretability remains a significant challenge. Existing model-agnostic GNN explainers aim to identify critical subgraphs or node features relevant to task predictions but often rely on GNN predictions for supervision, lacking ground-truth explanations. This limitation can introduce biases, causing explanations to fail in accurately reflecting the GNN’s decision-making processes. To address this, we propose a novel explainer for GNNs with graph segmentation and contrastive learning. Our model introduces a graph segmentation learning module to divide the input graph into explanatory and redundant subgraphs. Next, we implement edge perturbation to augment these subgraphs, generating multiple positive and negative pairs for contrastive learning between explanatory and redundant subgraphs. Finally, we develop a contrastive learning module to guide the learning of explanatory and redundant subgraphs by pulling positive pairs with the same explanatory subgraphs closer while pushing negative pairs with different explanatory subgraphs far away. This approach allows for a clearer distinction of critical subgraphs, enhancing the fidelity of the explanations. We conducted extensive experiments on graph classification and node classification tasks, demonstrating the effectiveness of the proposed method. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：