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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

235 篇 会议
180 篇 期刊文献
1 册 图书

馆藏范围

416 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

250 篇 工学
- 182 篇 计算机科学与技术...
- 153 篇 软件工程
- 68 篇 信息与通信工程
- 50 篇 电气工程
- 32 篇 光学工程
- 28 篇 生物工程
- 22 篇 生物医学工程（可授...
- 19 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 13 篇 化学工程与技术
- 12 篇 机械工程
- 10 篇 交通运输工程
- 9 篇 动力工程及工程热...
- 9 篇 建筑学
- 9 篇 土木工程
- 8 篇 仪器科学与技术
- 8 篇 网络空间安全
143 篇 理学
- 80 篇 数学
- 36 篇 物理学
- 35 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
- 11 篇 系统科学
- 9 篇 地球物理学
54 篇 管理学
- 35 篇 图书情报与档案管...
- 25 篇 管理科学与工程(可...
- 10 篇 工商管理
19 篇 医学
- 15 篇 临床医学
- 14 篇 基础医学(可授医学...
13 篇 法学
- 13 篇 社会学
6 篇 教育学
5 篇 经济学
4 篇 农学
1 篇 军事学

主题

31 篇 semantics
30 篇 feature extracti...
20 篇 accuracy
18 篇 training
16 篇 computational mo...
14 篇 contrastive lear...
13 篇 data mining
12 篇 image segmentati...
11 篇 visualization
11 篇 federated learni...
10 篇 speech processin...
10 篇 optimization
9 篇 anomaly detectio...
9 篇 noise
9 篇 graph neural net...
9 篇 data models
8 篇 deep learning
8 篇 three-dimensiona...
8 篇 signal processin...
8 篇 neural networks

机构

71 篇 shandong provinc...
61 篇 key laboratory o...
45 篇 shandong enginee...
32 篇 fujian provincia...
29 篇 college of compu...
19 篇 shandong fundame...
19 篇 national enginee...
15 篇 key laboratory o...
15 篇 guangdong provin...
14 篇 guangdong provin...
12 篇 college of mathe...
11 篇 shandong enginee...
11 篇 faculty of data ...
10 篇 key laboratory o...
10 篇 school of physic...
10 篇 key laboratory o...
10 篇 guizhou provinci...
9 篇 university of ch...
9 篇 shenzhen researc...
8 篇 college of compu...

作者

18 篇 guo wenzhong
11 篇 wang shiping
11 篇 jing zhao
11 篇 guo kun
10 篇 zhenyu yang
9 篇 li haizhou
8 篇 wang jinbao
8 篇 xiaodong wu
8 篇 shen linlin
8 篇 ke xiao
7 篇 niyato dusit
7 篇 yu zhiyong
6 篇 chen zhaoliang
6 篇 li yan
6 篇 jiguo yu
6 篇 qin lu
5 篇 hu liang
5 篇 yushui geng
5 篇 zhang lei
5 篇 huang fangwan

语言

384 篇 英文
31 篇 其他
1 篇 中文

检索条件"机构=Provincial Key Laboratory of Data-Intensive Computing"

共 416 条记录，以下是261-270 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Multi-User Probabilistic Semantic Communication with Semantic Compression Ratio Optimization

Multi-User Probabilistic Semantic Communication with Semanti...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Zhouxiang Zhao Zhaohui Yang Mingzhe Chen Changsheng You Qianqian Yang Wei Xu Zhaoyang Zhang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China National Mobile Communications Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798350304053

ISBN: (纸本)9798350304060

In this paper, the problem of joint transmission and computation resource allocation for a multi-user probabilistic semantic communication (PSC) network is investigated. In the considered model, users employ semantic information extraction techniques to compress their large-sized raw data before transmitting them to a multi-antenna base station (BS). Our model represents the raw data through comprehensive knowledge graphs, utilizing shared probability graphs between users and the BS for efficient semantic compression. The resource allocation problem is formulated as an optimization problem with the objective of maximizing the sum of equivalent rate of all users, considering total power budget constraint. This joint optimization problem inherently addresses the delicate balance between transmission efficiency and computational complexity. To address this optimization challenge, we present an iterative algorithm in which the optimal solution for the semantic compression ratio of a specific user is determined at each iteration. Numerical results validate the effectiveness of the proposed scheme.

关键词： Conferences Computational modeling Semantics Knowledge graphs Probabilistic logic Information retrieval data models

来源：评论

学校读者我要写书评

暂无评论

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Network Based on Generative Adversarial Network

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Net...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ran Qiu Hu Liang Yuchen Liu Shengrong Zhao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Image inpainting, which aims to reconstruct reasonably clear and realistic images from known pixel information, is one of the core problems in computer vision. However, due to the complexity and variability of the underwater environment, the inability to extract valid pixel points and insufficient correlation between feature information in existing image inpainting techniques lead to blurring in the generated images. Therefore, a novel gated attention feature fusion image inpainting network based on generative adversarial networks (GAF-GAN) is proposed. The accuracy of feature similarity matching depends heavily on the validity of the information contained in the features. On the one hand, gating values are dynamically generated by gated convolution to reduce the interference of invalid information. On the other hand, semantic information at distant locations in an image is accurately acquired by the attention mechanism. For these reasons, we designed an improved gated attention mechanism. Gated attention mechanism make the network focus on effective information such as high-frequency texture and color fidelity of restored images. In addition, the dense feature fusion module is added to expand the overall receptive field of the network to fully learn the image features. Experimental results show that the proposed method can effectively repair defective images with complex texture structures and improve the reality and integrity of image details and structures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sequence-to-Sequence Knowledge Graph Completion Based On Gated Attention Unit

Sequence-to-Sequence Knowledge Graph Completion Based On Gat...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Fengge Yi Xiumei Wei Xiaojing Liu Xuesong Jiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China State Key Laboratory of High-end Server & Storage Technology Jinan China

We present GauKGT5, a sequence-to-sequence model proposed for knowledge graph completion (KGC). Our research extends the KGT5 model, a recent sequence-to-sequence link prediction (LP) model. GauKGT5 takes advantage of textual characteristics inherent in the knowledge graph, exhibiting a small model size. However, KGT5’s proficiency in link prediction necessitates the ensemble with a knowledge graph embedding model, which itself poses challenges due to its substantial size and expense. By integrating the Gated Attention Unit into the KGT5 model and directly applying it to the encoder-decoder structure, we achieve improved contextual dependency capturing within the sequence, resulting in enhanced prediction accuracy, accelerated training speed, and enhanced computational efficiency. At the same time, we introduce parallel computing as a means to enhance the efficiency of model training and inference within the XPU distributed computing environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Parallelizable Counterfactual Generation Method Based on Gradient Optimization

A Parallelizable Counterfactual Generation Method Based on G...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Haorun Ding Xuesong Jiang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China State Key Laboratory of High-end Server & Storage Technology Jinan China

Post-hoc explanations are important for people to understand the predictions of explanation models. One class of methods in post-hoc explanation is the generation of counterfactuals, where a hypothetical example is obtained by perturbing the inputs to show how one could obtain a different prediction from the decision model. Counter-factual explanations should satisfy several properties: One is that counterfactuals generated under specific scenarios and constraints should be feasible for users, i.e., they should accommodate different causal constraints. The other is that it is more desirable for users to have a wider variety of viable examples, i.e., counterfactual diversity. To this end, we propose a parallelizable method based on gradient optimization. We partition the input feasible domains, perform counterfactual generation independently for each feasible domain, and then parallelize the counterfactual generation process for each feasible domain. Experimental results show that our approach effectively improves the diversity, sparsity, and proximity of the generated counterfactual instances on the public datasets Adult-Income, Lending-Club, German-Credit, and COMPAS compared to other models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rapid Maize Seedling Detection Based on Receptive-Field and Cross-Dimensional Information Interaction

Rapid Maize Seedling Detection Based on Receptive-Field and ...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Fengqi Hao Shulei Zhu Dexin Ma Xiangjun Dong Hoiio Kong Xia Liu Chunhua Mu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Faculty of Data Science City University of Macau Macau China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Communication College Qingdao Agricultural University Qingdao China National Engineering Laboratory of Wheat and Maize/Key Laboratory of Biology and Genetic Improvement of Maize in Northern Yellow-huai River Plain Ministry of Agriculture Maize Research Institute Shandong Academy of Agricultural Sciences Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

The seedling stage is important in the growth and development of maize, and it is also a critical period that affects maize yield and quality. Accurately recognizing this stage of maize is challenging, as current maize seedling detection methods struggle with small sizes and complex environments. This paper proposes a rapid maize seedling detection method that emphasizes spatial feature extraction in the receptive field and cross-dimensional interaction—receptive field triplet attention YOLO (RFT-YOLO). First, we design a convolutional module for cross-dimensional information interaction within the receptive field. Second, we introduce an advanced selective fusion network, which boosts the multi-scale fusion capability of small object features while reducing the GFLOPs of the model. Additionally, we employ Inner-IoU to diminish sensitivity to positional biases of small objects and expedite the convergence of the loss function. Finally, we create a dataset of maize seedlings to conduct our experiments. Experimental results demonstrate that the RFT-YOLO significantly enhances performance, reducing the number of parameters by 35.3% and GFLOPs by 14.24%, compared to the baseline model. Moreover, the mean average precision (mAP) improves from 89.6% to 91.5%. These improvements confirm the model's effectiveness in detecting maize seedlings.

关键词： YOLO Sensitivity Accuracy Semantics Feature extraction Complexity theory data mining Cybernetics Convergence

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Conference on Parallel and Distributed Systems (ICPADS)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LDVNet: Lightweight and Detail-Aware Vision Network for Image Recognition Tasks in Resource-Constrained Environments

LDVNet: Lightweight and Detail-Aware Vision Network for Imag...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yuchen Liu Hu Liang Ran Qiu Shengrong Zhao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

In many underwater application scenarios, recognition tasks need to be executed promptly on computationally limited platforms. However, models designed for this field often exhibit spatial locality, and existing works lack the ability to capture crucial details in images. Therefore, a lightweight and detail-aware vision network (LDVNet) for resource-constrained environments is proposed to overcome the limitations of these approaches. Firstly, in order to enhance the accuracy of target image recognition, we introduce transformer modules to acquire global information, thus addressing the issue of spatial locality inherent in traditional convolutional neural networks (CNNs). Secondly, to maintain the network’s lightweight nature, we integrate the transformer module with convolutional operations, thereby mitigating the substantial parameter and floating point operations (FLOPs) overhead. Thirdly, for the efficient extraction of crucial fine-grained details from feature maps, we have devised a channel and spatial attention module (C&SA). This module aids in recognizing intricate and fine-grained visual tasks and enhances image understanding. It is seamlessly integrated into LDVNet with nearly negligible parameter overhead. The experimental results demonstrate that LDVNet outperforms other lightweight networks and hybrid networks in different recognition tasks, while being suitable for resource-constrained environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Semantic Relay Aided Wireless Networks with Probability Graph

Resource Allocation for Semantic Relay Aided Wireless Networ...

引用

IEEE International Conference on Communications (ICC)

作者： Jiahui Zhao Ming Chen Zhaohui Yang Changsheng You Mingzhe Chen National Mobile Communications Research Laboratory Southeast University Nanjing China College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

In this paper, we introduce a novel uplink semantic relay (SemRelay)-aided wireless communication system, catering to multiple users by leveraging a shared probability graph between the SemRelay and the base station (BS). In this system, users transmit text information to the SemRelay through conventional bit transmission, and the SemRelay compresses this information using a knowledge based characterized by probability graph before transmitting it to the BS through semantic communication. Then, the BS recovers the information based on the shared probability graph. While the semantic information compression incurs computational resource consumption, it significantly reduces communication resource usage. This paper addresses the challenge of minimizing overall system latency through jointly optimizing communication and computation re-source allocation, considering limited wireless resources and the system's energy budget. To address this problem, we introduce an efficient iterative algorithm, which employs block coordinate descent for communication resource allocation and exhaustive searching for determining the optimal data compression scheme. In particular, both power allocation subproblem and bandwidth allocation subproblem are proved to be convex. The complexity analysis of the proposed algorithm are also provided. Numerical results validate the effectiveness of the proposed algorithm and the superior performance of semantic communication compared to the conventional bit transmission.

关键词： Wireless networks Semantics Knowledge based systems data compression Search problems Complexity theory Resource management

来源：评论

学校读者我要写书评

暂无评论

Semantic Relation-Based Cross Attention Network for Image-Text Retrieval

Semantic Relation-Based Cross Attention Network for Image-Te...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Huanxiao Zhou Yushui Geng Jing Zhao Xishan Ma Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Graduate School Qilu University of Technology (Shandong Academy of Sciences) Jinan China

ISBN: (数字)9781665410205

ISBN: (纸本)9781665410212

Image-text retrieval refers to querying the text or image of another modality given an image or text, and its key lies in the ability to accurately measure the similarity between text and image. Most of the existing retrieval methods only utilize the intramodal relations of each modality or the intermodal relations of the two modalities to perform the retrieval task. To address the above problems, we integrate the intra-modal and inter-modal relations and propose a Semantic Relation-based Cross Attention Network(SRCAN). In our proposed method, we first mine the possible intra-modal associations between regions in an image and between words in a text to obtain features with semantic relationships, and then capture the fine-grained associations between segments through the cross-attention mechanism. Finally, we balance the intra-modal and inter-modal relationships to improve the performance of the model. Our proposed method is experimentally validated on two datasets, Flickr30K and MS-COCO, and the experimental results show that our method achieves superior results.

关键词： Image segmentation Semantics Bidirectional control Feature extraction Cognition Feeds Cybernetics

来源：评论

学校读者我要写书评

暂无评论

GA-Net: Gated Attention Mechanism Based Global Refinement Network for Image Inpainting

GA-Net: Gated Attention Mechanism Based Global Refinement Ne...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ran Qiu Shengrong Zhao Hu Liang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Underwater images are often affected by problems such as light attenuation, color distortion, noise and scattering, resulting in image defects. A novel image inpainting method is proposed to intelligently predict and fill damaged areas for complete and continuous visualization of the image. First, in order to effectively solve the problem of color distortion caused by light refraction in underwater environments, the improved gated attention mechanism is used. This mechanism improves the local details by learning and weighting the important features of the image. Second, gated convolution automatically determines the degree of restoration for each pixel based on local features of the original image. It eliminates distractions such as low contrast and scattering, retaining more original detailed information. By doing so, image inpainting techniques improve the quality and visualization of underwater images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共42页 << < 23 24 25 26 27 28 29 30 31 32 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：