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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

282,603 篇 会议
17,623 册 图书

馆藏范围

299,995 篇 电子文献
263 种 纸本馆藏

日期分布

学科分类号

281,828 篇 工学
- 277,751 篇 计算机科学与技术...
- 67,717 篇 软件工程
- 14,895 篇 信息与通信工程
- 8,439 篇 电气工程
- 8,089 篇 控制科学与工程
- 4,688 篇 生物医学工程（可授...
- 974 篇 生物工程
- 827 篇 光学工程
- 606 篇 机械工程
- 568 篇 仪器科学与技术
- 494 篇 测绘科学与技术
- 492 篇 交通运输工程
35,837 篇 理学
- 28,677 篇 数学
- 5,532 篇 生物学
- 1,683 篇 物理学
- 1,126 篇 统计学（可授理学、...
- 517 篇 系统科学
- 482 篇 化学
30,399 篇 医学
- 22,124 篇 临床医学
- 9,245 篇 特种医学
- 3,035 篇 基础医学(可授医学...
- 1,217 篇 医学技术（可授医学...
10,775 篇 管理学
- 6,492 篇 管理科学与工程(可...
- 3,323 篇 图书情报与档案管...
- 1,770 篇 工商管理
- 743 篇 公共管理
4,314 篇 教育学
- 4,041 篇 教育学
2,337 篇 法学
- 1,997 篇 社会学
1,680 篇 文学
- 1,179 篇 新闻传播学
- 526 篇 外国语言文学
467 篇 艺术学
372 篇 经济学
149 篇 农学
98 篇 历史学
65 篇 哲学
24 篇 军事学

主题

10,830 篇 artificial intel...
4,631 篇 computer communi...
3,945 篇 deep learning
3,861 篇 information syst...
3,741 篇 computers
3,637 篇 software enginee...
3,332 篇 machine learning
3,243 篇 algorithm analys...
3,223 篇 semantics
2,288 篇 information stor...
2,190 篇 pattern recognit...
1,834 篇 neural networks
1,820 篇 user interfaces ...
1,820 篇 image processing...
1,805 篇 database managem...
1,794 篇 logics and meani...
1,777 篇 mathematical log...
1,770 篇 cryptography
1,757 篇 software enginee...
1,707 篇 data mining and ...

机构

651 篇 univ chinese aca...
541 篇 carnegie mellon ...
403 篇 univ chinese aca...
359 篇 univ calif berke...
353 篇 shanghai jiao to...
318 篇 stanford univ st...
307 篇 chinese acad sci...
288 篇 shanghai jiao to...
285 篇 inria
248 篇 tech univ munich...
241 篇 tech univ darmst...
225 篇 swiss fed inst t...
212 篇 univ waterloo wa...
207 篇 nanjing univ sta...
203 篇 tsinghua univ pe...
199 篇 ist austria klos...
198 篇 natl univ singap...
186 篇 mit cambridge ma...
185 篇 univ maryland co...
183 篇 chinese acad sci...

作者

212 篇 shen dinggang
104 篇 navab nassir
98 篇 zhang lei
94 篇 wang wei
92 篇 susilo willy
85 篇 liu yang
83 篇 rueckert daniel
81 篇 wang lei
81 篇 wang xin
76 篇 auer soeren
66 篇 golland polina
64 篇 weske mathias
61 篇 zhang yong
54 篇 liu wei
52 篇 zhang li
51 篇 zhou jie
49 篇 jiang xiaoyi
47 篇 zhang tao
47 篇 zhang yu
47 篇 ishai yuval

语言

298,284 篇 英文
1,937 篇 中文
1 篇 加泰罗尼亚文
1 篇 法文

检索条件"丛书名=Lecture notes in computer science,"

共 300226 条记录，以下是4771-4780 订阅

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

详细简洁

排序：

Evaluating the Impact of Content Deletion on Tabular Data Similarity and Retrieval Using Contextual Word Embeddings 46th

Evaluating the Impact of Content Deletion on Tabular Data Si...

引用

46th European Conference on Information Retrieval (ECIR)

作者： Berenguer, Alberto Tomas, David Mazon, Jose-Norberto Univ Alicante Dept Software & Comp Syst Carretera San Vicente del Raspeig S-N San Vicente Del Raspeig 03690 Spain

ISBN: (纸本)9783031560590;9783031560606

Table retrieval involves providing a ranked list of relevant tables in response to a search query. A critical aspect of this process is computing the similarity between tables. Recent Transformer-based language models have been effectively employed to generate word embedding representations of tables for assessing their semantic similarity. However, generating such representations for large tables comprising thousands or even millions of rows can be computationally intensive. This study presents the hypothesis that a significant portion of a table's content (i.e., rows) can be removed without substantially impacting its word embedding representation, thereby reducing computational costs while maintaining system performance. To test this hypothesis, two distinct evaluations were conducted. Firstly, an intrinsic evaluation was carried out using two different datasets and five state-of-the-art contextual and not-contextual language models. The findings indicate that, for large tables, retaining just 5% of the content results in a word embedding representation that is 90% similar to the original one. Secondly, an extrinsic evaluation was performed to assess how three different reduction techniques proposed affects the overall performance of the table-based query retrieval system, as measured by MAP, precision, and nDCG. The results demonstrate that these techniques can not only decrease data volume but also improve the performance of the table retrieval system.

关键词： Table retrieval Contextual word embeddings Semantic similarity

来源：评论

学校读者我要写书评

暂无评论

VUOS: A User-Space Hypervisor Based on System Call Hijacking 1

引用

43rd International Conference on computer Safety, Reliability and Security (SAFECOMP)

作者： Bassi, Luca Berardi, Davide Davoli, Renzo INFN CNAF Bologna Italy GARR Rome Italy Univ Mercatorum Rome Italy Alma Mater Studiorum Univ Bologna Bologna Italy

ISBN: (数字)9783031687389

ISBN: (纸本)9783031687372;9783031687389

VUOS (View based OS) is a virtual operating system that permits to give to each process a different view of the underlying system, i.e. access only some specific directories or specified system calls. This is currently obtained intercepting system call requests leveraging the ptrace system call. All the system call requests are forwarded to a VUOS hypervisor (umvu) that runs in user space. For each request, the hypervisor can use its own system call implementation or forward it to the Linux kernel. Running the hypervisor in the user space, like any other user process, increases the security because, in the case of sandbox escape bugs, the potentially malicious process obtains only limited system access. This approach can be seen as an extension to system calls of the FUSE behavior. FUSE (File system in Userspace) is a user-space file system framework that permits users to implement their own file systems without patching the Linux kernel. A kernel module forwards requests for each FUSE-mounted file system to its corresponding user process. FUSE is specific for file systems. VUOS instead permits to implement several system services in user space, like virtual devices, virtual networking and file systems (including reimplementing FUSE as a VUOS module).

关键词： System Calls User space Virtualization Security Sandbox

来源：评论

学校读者我要写书评

暂无评论

Parallax-Aware Image Stitching Based on Homographic Decomposition 45th

Parallax-Aware Image Stitching Based on Homographic Decompos...

引用

45th Annual Conference of the German-Association-for-Pattern-Recognition (DAGM GCPR)

作者： Seibt, Simon Arold, Michael Lipinski, Bartosz von Rymon Wienkopf, Uwe Latoschik, Marc Erich Nuremberg Inst Technol Game Tech Lab Fac Comp Sci Nurnberg Germany Nuremberg Inst Technol Inst Appl Comp Sci Nurnberg Germany Univ Wurzburg Inst Comp Sci Human Comp Interact Grp Wurzburg Germany

ISBN: (纸本)9783031546044;9783031546051

Image stitching plays a crucial role for various computer vision applications, like panoramic photography, video production, medical imaging and satellite imagery. It makes it possible to align two images captured at different views onto a single image with a wider field of view. However, for 3D scenes with high depth complexity and images captured from two different positions, the resulting image pair may exhibit significant parallaxes. Stitching images with multiple or large apparent motion shifts remains a challenging task, and existing methods often fail in such cases. In this paper, a novel image stitching pipeline is introduced, addressing the aforementioned challenge: First, iterative dense feature matching is performed, which results in a multi-homography decomposition. Then, this output is used to compute a per-pixel multidimensional weight map of the estimated homographies for image alignment via weighted warping. Additionally, the homographic image space decomposition is exploited using combinatorial analysis to identify parallaxes, resulting in a parallax-aware overlapping region: Parallax-free overlapping areas only require weighted warping and blending. For parallax areas, these operations are omitted to avoid ghosting artifacts. Instead, histogram- and mask-based color mapping is performed to ensure visual color consistency. The presented experiments demonstrate that the proposed method provides superior results regarding precision and handling of parallaxes.

关键词： Image Stitching Parallaxes Feature Matching

来源：评论

学校读者我要写书评

暂无评论

SeWi: A Framework Enhancing CSI-Based Human Activity Recognition 20th

SeWi: A Framework Enhancing CSI-Based Human Activity Recogni...

引用

20th International Conference on Intelligent Computing (ICIC)

作者： Zhang, Wei Li, Jiayuan Ge, Fei Hu, Jianyuan Dai, Zhenyang Cao, Xinyu Yang, Zhimin Shuai, Xiaowei Cent China Normal Univ Wuhan 430079 Peoples R China China Mobile Commun Grp Beijing Peoples R China

ISBN: (纸本)9789819755936;9789819755943

With the widespread application of WiFi devices, utilizing Channel State Information (CSI) for human activity recognition has garnered significant attention. However, the reliability of WiFi sensing signals is often compromised due to the operation of most WiFi devices in complex electromagnetic environments. Consequently, the accuracy of current recognition systems often falls short of expectations, impeding the practical application of WiFi sensing. We discover that segmenting and reassembling data can yield features from multiple perspectives, thereby enhancing recognition accuracy. In this paper, we propose a versatile segmentation component capable of employing various segmentation methods. Based on this, we develop the SeWi learning framework to improve the accuracy of the original basic model. In our experiments, we analyze the sliding window segmentation method and utilize four different models as the basic models for SeWi. We also analyze the effective range of hyperparameters for this segmentation method. The results indicate that SeWi exhibits varying degrees of improvement for different models. Of particular note, using ResNet18 as the basic model for SeWi, the accuracy achieved on the Widar and UT-HAR public datasets is 74.8% and 98.7%, respectively. To the best of our knowledge, these results represent an increase of 3.1% and 0.6%, respectively, compared to the best results reported in recent studies.

关键词： Segmentation Components CSI WiFi Deep Learning Human Activity Recognition

来源：评论

学校读者我要写书评

暂无评论

Bivariate Hue Blending - A Tool for Designing Bivariate Choropleth Color Schemes 19th

Bivariate Hue Blending - A Tool for Designing Bivariate Chor...

引用

19th International-Federation-for-Information-Processing-Technical-Committee-13 (IFIP TC13) International Conference on Human-computer Interaction (INTERACT)

作者： Hilden, Jonatan Aalto Univ Otakaari 1B Espoo 00076 Finland

ISBN: (纸本)9783031616976;9783031616983

This paper discusses the relevance of bivariate choropleth maps particularly of the sequential/sequential or diagonal focal model type, designed to be used for visualizing two correlated quantitative variables. It then describes an interactive prototype tool for designing color palettes to be used on this type of bivariate choropleth maps, based on rotating hue angles in the Hue Chroma Lightness color space.

关键词： bivariate maps visualization color palette tool

来源：评论

学校读者我要写书评

暂无评论

Improving the Accuracy of Text-to-SQL Tools Based on Large Language Models for Real-World Relational Databases 35th

Improving the Accuracy of Text-to-SQL Tools Based on Large L...

引用

35th International Conference on Database and Expert Systems Applications (DEXA)

作者： Coelho, Gustavo M. C. Nascimento, Eduardo R. S. Izquierdo, Yenier T. Garcia, Grettel M. Feijo, Lucas Lemos, Melissa Garcia, Robinson L. S. de Oliveira, Aiko R. Pinheiro, Joao P. Casanova, Marco A. Pontificia Univ Catolica Rio de Janeiro Inst Tecgraf BR-22451900 Rio de Janeiro RJ Brazil Petrobras SA BR-20031912 Rio De Janeiro RJ Brazil Pontificia Univ Catolica Rio de Janeiro Dept Informat BR-22451900 Rio de Janeiro RJ Brazil

ISBN: (纸本)9783031683084;9783031683091

Real-world relational databases (RW-RDB) have large, complex schemas often expressed in terms alien to end-users. This scenario is challenging to LLM-based text-to-SQL tools, that is, tools that translate Natural Language (NL) sentences into SQL queries using a Large Language Model (LLM). Indeed, their accuracy on RW-RDBs is considerably less than that reported for well-known synthetic benchmarks. This paper then introduces a technique to improve the accuracy of LLM-based text-to-SQL tools on RW-RDBs using Retrieval-Augmented Generation. The technique consists of two steps. Using the RW-RDB schema, the first step generates a synthetic dataset E of pairs (QN, QS), where QN is an NL sentence and QS is the corresponding SQL translation. The core contribution of the paper is an algorithm that implements this first step. Given an input NL sentence QI, the second step retrieves pairs (QN, QS) from E based on the similarity of QI and QN, and prompts such pairs to the LLM to improve accuracy. To argue in favor of the proposed technique, the paper includes experiments with an RW-RDB, which is in production at an Energy company, and a well-known text-to-SQL prompt strategy. It repeats the experiments with Mondial, an openly available database with a large schema. These experiments constitute a second contribution of the paper.

关键词： Text-to-SQL Retrieval-Augmented Generation RAG GPT Large Language Models Relational Databases

来源：评论

学校读者我要写书评

暂无评论

Scaling up Nonmonotonic c-Inference via Partial MaxSAT Problems 13th

Scaling up Nonmonotonic c-Inference via Partial MaxSAT Probl...

引用

13th International Symposium on Foundations of Information and Knowledge Systems (FoIKS)

作者： von Berg, Martin Sanin, Arthur Beierle, Christoph Fernuniv Fac Math & Comp Sci Knowledge Based Syst D-58084 Hagen Germany

ISBN: (纸本)9783031569395;9783031569401

Ranking functions, also called ordinal conditional functions (OCF), provide a semantics for conditionals by assigning a degree of implausibility to the underlying possible worlds. The entailment relation c-inference takes all c-representations, which are special ranking functions, into account, and exhibits excellent properties put forward for nonmonotonic reasoning. However, for realizing c-inference, showing the unsolvability of a complex constraint satisfaction problem (CSP) is required, involving in particular satisfaction conditions affecting all possible worlds. All previous implementations of c-inference are severely limited by this requirement, making inferences from conditional belief bases involving more than about 25 signature elements, and thus 2(25) possible worlds, practically infeasible. In this paper, we present an approach for reducing the size of the CSP underlying c-inference significantly by using partial maximum satisfiability problems (PMaxSAT) and the power of current PMaxSAT solvers. In particular, we introduce the dual notion of minimum satisfiability problems for simplifying the minimum expressions in the CSP. We prove the soundness of our CSP optimization and develop an implementation for it. An evaluation demonstrates that it outperforms all previous implementations and that it, while still having to cope with the exponentially increasing number of possible worlds, scales up c-inference to a new dimension, allowing for c-inference from belief bases with up to 100 signature elements and thus involving 2(100) possible worlds.

关键词： Conditional Belief Base Nonmonotonic Reasoning c-Inference Partial MaxSAT

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Learning for Character Recognition in Persian Historical Documents 9th

Few-Shot Learning for Character Recognition in Persian Histo...

引用

9th Annual Conference on Machine Learning, Optimization and Data science (LOD)

作者： Hajebrahimi, Alireza Santoso, Michael Evan Kovacs, Mate Kryssanov, Victor V. Ritsumeikan Univ Coll Informat Sci & Engn 1-1-1 Nojihigashi Kusatsu Shiga 5258577 Japan

ISBN: (纸本)9783031539688;9783031539695

Digitizing historical documents is crucial for the preservation of cultural heritage. The digitization of documents written in PersoArabic scripts, however, presents multiple challenges. The Nastaliq calligraphy can be difficult to read even for a native speaker, and the four contextual forms of alphabet letters pose a complex task to current optical character recognition systems. To address these challenges, the presented study develops an approach for character recognition in Persian historical documents using few-shot learning with Siamese Neural Networks. A small, novel dataset is created from Persian historical documents for training and testing purposes. Experiments on the dataset resulted in a 94.75% testing accuracy for the few-shot learning task, and a 67% character recognition accuracy was observed on unseen documents for 111 distinct character classes.

关键词： Few-shot learning Historical Documents Character Recognition Persian Language Siamese Neural Networks

来源：评论

学校读者我要写书评

暂无评论

Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices Under Recombination 24th

Reduction-Based MAX-3SAT with Low Nonlinearity and Lattices ...

引用

24th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP)

作者： Whitley, Darrell Ochoa, Gabriela Floyd, Noah Chicano, Francisco Colorado State Univ Dept Comp Sci Ft Collins CO 80523 USA Univ Stirling Comp Sci & Math Stirling Scotland Univ Malaga ITIS Software Malaga Spain

ISBN: (纸本)9783031577116;9783031577123

A new construction is introduced for creating random MAX3SAT instances with low nonlinearity. Instead of generating random clauses, we generate random SAT expressions over 3 variables and then convert these into CNF SAT clauses. We prove that this yields structured problems with much lower nonlinearity. We also introduce a new method for weighting MAX-SAT clauses that preserves low nonlinearity and also breaks up plateaus. We evaluate these new problems by enumeration of instances with n = 30 variables. One unexpected result is that Partition Crossover creates more tunnels on these semi-structured MAX-SAT problems compared to results on random NK landscapes. We show that Partition Crossover induces hypercube lattices over subsets of local optima;all of the local optima which appear in a lattice can be evaluated with a single linear equation.

关键词： MAX-SAT Recombination Operators Partition Crossover Evolutionary Combinatorial Optimization

来源：评论

学校读者我要写书评

暂无评论

Decoding Tree Decompositions from Permutations 16th

Decoding Tree Decompositions from Permutations

引用

16th Latin American Symposium on Theoretical Informatics (LATIN)

作者： da Silva, Samuel Eduardo Souza, Ueverton S. Univ Fed Fluminense Inst Comp Niteroi RJ Brazil

ISBN: (纸本)9783031555978;9783031555985

Most algorithmic strategies for solving problems considering treewidth parameterization require that a tree decomposition is given. Given a graph G = (V, E) and denoting by C-G the family of chordal graphs (triangulations) G ' such that V (G) = V (G ') and E(G) subset of E(G '), the treewidth of a graph G can be defined alternatively as the size of the smallest maximum clique of a graph in C-G, minus one. In addition, any tree decomposition T of a graph G ' is an element of C-G is also a tree decomposition of G. In this paper, we are interested in the main subproblem to be solved by the most popular heuristics for treewidth computation, called Tree Decomposition Decoding. In such a problem, we are given a graph G = (V, E) and a permutation rho of V (G) and asked to determine the width of the tree decomposition T of G that is an optimum tree decomposition of the minimal triangulation G ' is an element of C-G having rho as perfect elimination ordering. From (G, rho), it is easy to find the solution to the problem by first constructing the triangulation G ' arising from.. However, in the worst case, such constructions of G ' require Theta(vertical bar V(G)vertical bar(2)) space. In this work, we propose two algorithms for solving the problem;both avoid the construction of triangulations G '. The first performers in O(vertical bar V(G)vertical bar center dot l) space and O(vertical bar V(G)vertical bar(2) center dot l) time, where l is the number of leaves of the tree decomposition encoded by rho. The second is faster in practice and achieves a different trade-off, solving the problem within O(vertical bar E(G)vertical bar + vertical bar V (G)vertical bar) space and O(vertical bar E(G)vertical bar center dot log vertical bar V (G)vertical bar) time.

关键词： Tree decomposition Treewidth Perfect elimination order Decoder

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 474 475 476 477 478 479 480 481 482 483 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：