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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,238 篇 会议
5,963 篇 期刊文献
141 册 图书

馆藏范围

16,342 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

10,571 篇 工学
- 8,251 篇 计算机科学与技术...
- 6,812 篇 软件工程
- 2,172 篇 信息与通信工程
- 1,287 篇 控制科学与工程
- 1,122 篇 生物工程
- 848 篇 电气工程
- 727 篇 机械工程
- 643 篇 电子科学与技术（可...
- 612 篇 光学工程
- 604 篇 生物医学工程（可授...
- 389 篇 化学工程与技术
- 359 篇 仪器科学与技术
- 350 篇 安全科学与工程
- 321 篇 动力工程及工程热...
- 317 篇 交通运输工程
- 300 篇 网络空间安全
- 279 篇 建筑学
4,798 篇 理学
- 2,807 篇 数学
- 1,230 篇 生物学
- 950 篇 物理学
- 826 篇 统计学（可授理学、...
- 521 篇 系统科学
- 410 篇 化学
3,061 篇 管理学
- 1,850 篇 管理科学与工程(可...
- 1,330 篇 图书情报与档案管...
- 748 篇 工商管理
517 篇 医学
- 446 篇 临床医学
- 387 篇 基础医学(可授医学...
439 篇 法学
- 329 篇 社会学
281 篇 经济学
- 279 篇 应用经济学
237 篇 教育学
151 篇 农学
43 篇 军事学
43 篇 艺术学
37 篇 文学
9 篇 哲学
3 篇 历史学

主题

621 篇 computer science
485 篇 software enginee...
339 篇 semantics
324 篇 computational mo...
323 篇 feature extracti...
304 篇 deep learning
260 篇 training
223 篇 data mining
212 篇 educational inst...
209 篇 optimization
174 篇 predictive model...
172 篇 neural networks
170 篇 application soft...
169 篇 image segmentati...
160 篇 machine learning
155 篇 internet of thin...
155 篇 computer archite...
142 篇 authentication
137 篇 servers
133 篇 support vector m...

机构

428 篇 college of compu...
361 篇 school of comput...
271 篇 school of inform...
265 篇 school of comput...
222 篇 school of comput...
218 篇 school of comput...
186 篇 state key labora...
153 篇 school of softwa...
134 篇 school of comput...
128 篇 school of electr...
125 篇 national enginee...
108 篇 school of softwa...
107 篇 school of comput...
103 篇 state key labora...
101 篇 school of softwa...
99 篇 college of compu...
98 篇 college of compu...
98 篇 school of softwa...
97 篇 school of comput...
97 篇 school of softwa...

作者

69 篇 tao dacheng
51 篇 chen zhong
51 篇 zheng zibin
50 篇 liu yang
39 篇 wang ping
37 篇 hu ruimin
35 篇 limin xiao
35 篇 huang di
34 篇 wang yasha
34 篇 gao yang
32 篇 wang lei
32 篇 ruimin hu
31 篇 bo du
31 篇 miao huaikou
31 篇 mian ajmal
30 篇 jun zhang
30 篇 qi lianyong
29 篇 wang wei
28 篇 niyato dusit
27 篇 cui lizhen

语言

14,465 篇 英文
1,641 篇 其他
265 篇 中文
3 篇 德文
3 篇 日文
2 篇 法文
2 篇 朝鲜文
1 篇 斯洛文尼亚文

检索条件"机构=School of Computer Science and software Engineering"

共 16342 条记录，以下是561-570 订阅

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

详细简洁

排序：

Optimal Bounds for Distinct Quartics 51

Optimal Bounds for Distinct Quartics

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Charalampopoulos, Panagiotis Gawrychowski, Pawel Ghazawi, Samah School of Computing and Mathematical Sciences Birkbeck University of London United Kingdom Institute of Computer Science University of Wroclaw Poland Department of Computer Science University of Haifa Israel Department of Software Engineering Braude College of Engineering Karmiel Israel

ISBN: (纸本)9783959773225

A fundamental concept related to strings is that of repetitions. It has been extensively studied in many versions, from both purely combinatorial and algorithmic angles. One of the most basic questions is how many distinct squares, i.e., distinct strings of the form UU, a string of length n can contain as fragments. It turns out that this is always O(n), and the bound cannot be improved to sublinear in n [Fraenkel and Simpson, JCTA 1998]. Several similar questions about repetitions in strings have been considered, and by now we seem to have a good understanding of their repetitive structure. For higher-dimensional strings, the basic concept of periodicity has been successfully extended and applied to design efficient algorithms – it is inherently more complex than for regular strings. Extending the notion of repetitions and understanding the repetitive structure of higher-dimensional strings is however far from complete. Quartics were introduced by Apostolico and Brimkov [TCS 2000] as analogues of squares in two dimensions. Charalampopoulos, Radoszewski, Rytter, Waleń, and Zuba [ESA 2020] proved that the number of distinct quartics in an n × n 2D string is O(n2 log2 n) and that they can be computed in O(n2 log2 n) time. Gawrychowski, Ghazawi, and Landau [SPIRE 2021] constructed an infinite family of n × n 2D strings with Ω(n2 log n) distinct quartics. This brings the challenge of determining asymptotically tight bounds. Here, we settle both the combinatorial and the algorithmic aspects of this question: the number of distinct quartics in an n × n 2D string is O(n2 log n) and they can be computed in the worst-case optimal O(n2 log n) time. As expected, our solution heavily exploits the periodic structure implied by occurrences of quartics. However, the two-dimensional nature of the problem introduces some technical challenges. Somewhat surprisingly, we overcome the final challenge for the combinatorial bound using a result of Marcus and Tardos [JCTA 2004] for permuta

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

引用

25th International Conference on Web Information Systems engineering, WISE 2024

作者： Tu, Longchuan Meng, Shunmei Liu, Xiao Liu, Guanfeng Beheshti, Amin Zhang, Xuyun School of Computer Science and Engineering Nanjing University of Science and Technology Nanjin China State Key Laboratory for Novel Software Technology Nanjing University Nanjin China School of Computing Macquarie University Sydney Australia

ISBN: (纸本)9789819605699

Recently, graph neural networks(GNNs) have played a key crucial in many recommendation situations. In particular, contrastive learning-based hypergraph neural networks (HGNNs) are gradually becoming a research focus for addressing issues of data sparsity and noise. Despite many studies proving their outstanding performance, there are still some shortcomings: i) Most contrastive learning-based HGNNs primarily rely on cross-view contrastive learning, while neglecting contrastive learning on the interaction graph. ii) Utilizing node embedding for hypergraph structure learning is susceptible to the influence of low-quality representations, thereby constraining the learning capability of HGNNs. To address these issues, we offer a Semantic Similarity-based Graph Contrastive Learning framework (SSGCL), which aims to jointly learn representations with rich semantic information through within-view and cross-view contrastive learning. Specifically, we first introduce consistency contrastive learning, which captures self-supervised signals through semantic similarity between nodes and their neighborhoods. It better captures the unique features of nodes through the connections between nodes and their neighborhoods. Then, we utilize interaction graph learning hypergraph structure, promoting it to extract potential node connections and thus improving its ability to describe homogeneous node relationships. Experimental evaluations on three actual datasets show that SSGCL performs much better than the current baseline models. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A novel transformer-based graph generation model for vectorized road design

A novel transformer-based graph generation model for vectori...

引用

作者： Zhou, Peichi Li, Chen Zhang, Jian Wang, Changbo Qin, Hong Liu, Long School of Software Engineering East China Normal University Shanghai China School of Computer Science and Technology East China Normal University Shanghai China Department of Computer Science StonyBrook University Stony BrookNY United States

Road network design, as an important part of landscape modeling, shows a great significance in automatic driving, video game development, and disaster simulation. To date, this task remains labor-intensive, tedious and time-consuming. Many improved techniques have been proposed during the last two decades. Nevertheless, most of the state-of-the-art methods still encounter problems of intuitiveness, usefulness and/or interactivity. As a rapid deviation from the conventional road design, this paper advocates an improved road modeling framework for automatic and interactive road production driven by geographical maps (including elevation, water, vegetation maps). Our method integrates the capability of flexible image generation models with powerful transformer architecture to afford a vectorized road network. We firstly construct a dataset that includes road graphs, density map and their corresponding geographical maps. Secondly, we develop a density map generation network based on image translation model with an attention mechanism to predict a road density map. The usage of density map facilitates faster convergence and better performance, which also serves as the input for road graph generation. Thirdly, we employ the transformer architecture to evolve density maps to road graphs. Our comprehensive experimental results have verified the efficiency, robustness and applicability of our newly-proposed framework for road design. © 2024 John Wiley & Sons Ltd.

关键词： Roads and streets

来源：评论

学校读者我要写书评

暂无评论

A Survey on Metaverse: Applications, Crimes and Governance

A Survey on Metaverse: Applications, Crimes and Governance

引用

2023 IEEE International Conference on Metaverse Computing, Networking and Applications, MetaCom 2023

作者： Lin, Kaixin Wu, Jiajing Lin, Dan Zheng, Zibin Sun Yat-Sen University School of Computer Science and Engineering Guangzhou China Sun Yat-Sen University School of Software Engineering Zhuhai China

ISBN: (纸本)9798350333336

With the rapid development of blockchain and the increasing computing power, the realization of the metaverse has become possible. However, there are not yet well-regulated and standardized industry standards for the metaverse, thus various financial crimes have been bred in many metaverse projects: scams, code exploits, wash trading, money laundering, illegal services, shops, etc. For this reason, it is urgent to categorize the crimes that exist in the metaverse ecosystem and summarize the corresponding governance. In this paper, we first describe the background and applications of the metaverse. Next, we present detailed case studies on different types of crimes in the metaverse, and summarize the metaverse's current regulatory measures, related governance. Finally, we suggest possible directions and recommendations for the development of relevant measures and governance. The overview of this paper is expected to help readers gain a deeper understanding of the financial threats in the metaverse. © 2023 IEEE.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

MaGIC: Multi-modality Guided Image Completion 12

MaGIC: Multi-modality Guided Image Completion

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Wang, Hao Yu, Yongsheng Luo, Tiejian Fan, Heng Zhang, Libo School of Computer Science and Technology University of Chinese Academy of Sciences China Institute of Software Chinese Academy of Sciences China Department of Computer Science University of Rochester United States Department of Computer Science and Engineering University of North Texas United States

Vanilla image completion approaches exhibit sensitivity to large missing regions, attributed to the limited availability of reference information for plausible generation. To mitigate this, existing methods incorporate the extra cue as a guidance for image completion. Despite improvements, these approaches are often restricted to employing a single modality (e.g., segmentation or sketch maps), which lacks scalability in leveraging multi-modality for more plausible completion. In this paper, we propose a novel, simple yet effective method for Multi-modal Guided Image Completion, dubbed MaGIC, which not only supports a wide range of single modality as the guidance (e.g., text, canny edge, sketch, segmentation, depth, and pose), but also adapts to arbitrarily customized combination of these modalities (i.e., arbitrary multi-modality) for image completion. For building MaGIC, we first introduce a modality-specific conditional U-Net (MCU-Net) that injects single-modal signals into a U-Net denoiser for single-modal guided image completion. Then, we devise a consistent modality blending (CMB) method to leverage modality signals encoded in multiple learned MCU-Nets through gradient guidance in latent space. Our CMB is training-free, thereby avoiding the cumbersome joint re-training of different modalities, which is the secret of MaGIC to achieve exceptional flexibility in accommodating new modalities for completion. Experiments show the superiority of MaGIC over state-of-the-art methods and its generalization to various completion tasks. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Multi-cost fusion stereo matching algorithm based on guided filter aggregation 3

Multi-cost fusion stereo matching algorithm based on guided ...

引用

3rd International Conference on Artificial Intelligence and computer engineering, ICAICE 2022

作者： Liu, Jingwen Zhang, Xuedong School of Computer and Software Engineering University of Science and Technology Liaoning Anshan114051 China School of Electronic and Information Engineering University of Science and Technology Liaoning Anshan114051 China

ISBN: (纸本)9781510663473

Aiming at the low matching accuracy of existing local stereo matching algorithms in weak texture areas, a local stereo matching algorithm based on multi-matching cost fusion and guided filtering cost aggregation with adaptive parameters is proposed. First, use the gradient direction to improve the gradient cost, and calculate the matching cost by combining the gradient cost with the Census transform and color cost. Secondly, the cost is aggregated by the guided filtering of adaptive parameters;Finally, the final disparity map is obtained through disparity calculation and multi-step disparity refinement. The improved algorithm is tested on 15 training sets on the Middlebury3 platform, and the average false matching rates of bad4.0 in all areas and non-occluded areas are 19.9% and 13.2%, respectively, which is improved compared with AD-Census and other algorithms. © 2023 SPIE.

关键词： Textures

来源：评论

学校读者我要写书评

暂无评论

Money Laundering Detection on Ethereum: Applying Traditional Approaches to New Scene 29

Money Laundering Detection on Ethereum: Applying Traditional...

引用

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

作者： Yu, Yunmei Wu, Jiajing Lin, Dan Fu, Qishuang Sun Yat-Sen University School of Computer Science and Engineering Guangzhou China Sun Yat-Sen University School of Software Engineering Guangzhou China

ISBN: (纸本)9798350330717

With the continuous evolution of blockchain technology, cryptocurrency platforms such as Ethereum have emerged as centers for digital asset transactions and smart contracts deployment. However, this nascent financial ecosystem also introduces potential money laundering risks. The traditional financial industry has accumulated significant antimoney laundering (AML) experience and technical means for monitoring and detecting money laundering activities. Yet, the adaptability of these established AML algorithms in the context of blockchain remains unclear. This paper aims to investigate the practical adaptability of traditional AML algorithms on Ethereum data through empirical experiments. We gather eight real-world money laundering case datasets collected from Ethereum and conduct experiments using three traditional AML algorithms on these datasets. We evaluate the performance of these algorithms from various angles, including precision, recall, and the distribution of detected accounts' labels in comparison to the original datasets. It turns out algorithms demonstrate distinct performance in diverse money laundering cases, indicating that the adaptability of traditional AML algorithms on Ethereum data presents certain adaptability and limitations. Holoscope's accuracy demonstrates the value of dense subgraph properties in Ethereum money laundering detection, and further research can be conducted based on this model framework combined with the money laundering characteristics of Ethereum. Our study provides valuable insights for strengthening AML mechanisms on blockchain platforms and offers guidance for further research on detecting money laundering accounts in blockchain environments. © 2023 IEEE.

关键词： Anti-money laundering Blockchain Security Ethereum Money Laundering Detection

来源：评论

学校读者我要写书评

暂无评论

A Two-Stream Word-level Information Fusion BERT Model for Event Element Entity Recognition 12

A Two-Stream Word-level Information Fusion BERT Model for Ev...

引用

12th International Conference on Advanced Cloud and Big Data, CBD 2024

作者： Zhang, Yan Li, Kaiwen Zhang, Jinghui Zhou, Jingya School of Information Engineering Shanghai Donghai Vocational& Technical Colledge Shanghai China School of Software Engineering Southeast University Nanjing China School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9798331511074

This paper primarily explores methods for enhancing the performance of event element entity recognition tasks by enriching the positional information of vocabulary and focusing on document context. It proposes and implements an event element entity recognition algorithm based on vocabulary-enhanced dual-stream encoders named Two-Stream Word-level Information Fusion BERT, TSWLIF-BERT. A word-level information fusion layer that fully integrates the vocabulary and its positional information was designed and implemented.: (1) Designed and implemented a word-level information fusion layer that fully integrates both the vocabulary and their positional information, deeply integrating the vocabulary and positional information in the pre-trained model, thereby obtaining an enhanced vocabulary model (Word-level Information Fusion BERT, WLIF-BERT).(2) Based on the model WLIF-BERT, designed a dual-stream encoder that considers cross-sentence information with a global encoder and focuses on sentence-internal information with a local encoder, fully modeling the contextual information.(3) Used masked conditional random fields to solve the problem of illegal sequence label transitions in models based on conditional random fields. Experiments show that this method significantly improves performance in event element entity recognition tasks. © 2024 IEEE.

关键词： Information fusion

来源：评论

学校读者我要写书评

暂无评论

Abstract-level Deductive Reasoning for Pre-trained Language Models 30

Abstract-level Deductive Reasoning for Pre-trained Language ...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wu, Xin Cai, Yi Leung, Ho-Fung School of Software Engineering South China University of Technology China Ministry of Education China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong

ISBN: (纸本)9782493814104

Pre-trained Language Models have been shown to be able to emulate deductive reasoning in natural language. However, PLMs are easily affected by irrelevant information (e.g., entity) in instance-level proofs when learning deductive reasoning. To address this limitation, we propose an Abstract-level Deductive Reasoner (ADR). ADR is trained to predict the abstract reasoning proof of each sample, which guides PLMs to learn general reasoning patterns rather than instance-level knowledge. Experimental results demonstrate that ADR significantly reduces the impact of PLMs learning instance-level knowledge (over 70%). © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

YFLM: An Improved Levenberg-Marquardt Algorithm for Global Bundle Adjustment 41st

YFLM: An Improved Levenberg-Marquardt Algorithm for Global ...

引用

41st computer Graphics International Conference, CGI 2024

作者： Peng, Jiaxin Li, Tao Jiang, Qin Liu, Jie Wang, Ruibo Laboratory of Software Engineering for Complex Systems School of Computer Science National University of Defense Technology Hunan Changsha410073 China Parallel and Distributed Processing Laboratory School of Computer Science National University of Defense Technology Hunan Changsha410073 China

ISBN: (纸本)9783031820205

The conventional Levenberg-Marquardt (LM) algorithm is a state-of-the-art trust-region optimization method for solving bundle adjustment problems in the Structure-from-Motion community, which not only takes advantage of the fast convergence of the Gauss-Newton method, but also the stability of the gradient descent method when approaching optimal solutions. However, the damping ratio of LM is simply provided by trial-and-error, which causes slow convergence rate for large-scale problems. This paper proposes the Yamashita-Fukushima LM (YFLM) algorithm to reduce the time complexity for global bundle adjustment, where the damping factor is determined by Yamashita and Fukushima’s method. YFLM dynamically calculates a more reasonable and optimal damping ratio according to the newest reprojection error. The experimental results show that the YFLM algorithm outperforms the conventional LM algorithm for most public bundle adjustment datasets. Besides this, the convergence of the YFLM algorithm is also evaluated with different σ∈(0,2]. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Damping

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：