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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
17 册 图书
8 篇 期刊文献

馆藏范围

259 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

171 篇 工学
- 160 篇 计算机科学与技术...
- 64 篇 软件工程
- 17 篇 电气工程
- 17 篇 信息与通信工程
- 6 篇 控制科学与工程
- 5 篇 机械工程
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
- 3 篇 建筑学
- 3 篇 土木工程
- 3 篇 交通运输工程
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
71 篇 理学
- 56 篇 数学
- 12 篇 物理学
- 7 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 生物学
- 4 篇 系统科学
19 篇 管理学
- 11 篇 图书情报与档案管...
- 10 篇 管理科学与工程(可...
- 6 篇 工商管理
6 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
- 3 篇 公共卫生与预防医...
- 3 篇 药学(可授医学、理...
5 篇 法学
- 5 篇 社会学
4 篇 教育学
- 4 篇 教育学
1 篇 经济学
1 篇 文学

主题

16 篇 graph theory
11 篇 artificial intel...
8 篇 discrete mathema...
8 篇 automata theory
6 篇 theory of comput...
6 篇 computer communi...
6 篇 algorithm analys...
5 篇 software enginee...
5 篇 information stor...
4 篇 software enginee...
4 篇 database managem...
4 篇 computers
4 篇 data structures
4 篇 information retr...
3 篇 computer science
3 篇 approximation al...
3 篇 computational co...
3 篇 turing machines
3 篇 set theory
3 篇 logic programmin...

机构

3 篇 university of be...
2 篇 katholieke univ ...
2 篇 department of co...
2 篇 charles universi...
2 篇 rhein westfal th...
2 篇 warsaw universit...
2 篇 vrije univ bruss...
2 篇 university of ch...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 department of in...
2 篇 department of co...
1 篇 university of ca...
1 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 univ nacl pedro ...
1 篇 weizmann inst sc...
1 篇 univ kassel fach...
1 篇 univ wroclaw ins...

作者

3 篇 wagner dorothea
3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
3 篇 černá ivana
2 篇 peleg david
2 篇 bieliková mária
2 篇 bogaerts b. a. r...
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 paulusma daniel
2 篇 inenaga shunsuke
2 篇 denecker m. a. r...
2 篇 kiya hironori
2 篇 fuchs janosch
2 篇 bongartz d
2 篇 donahoo michael ...

语言

255 篇 英文
4 篇 中文
1 篇 其他

检索条件"任意字段=36th Conference on Current Trends in Theory and Practice of Computer Science"

共 260 条记录，以下是201-210 订阅

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

详细简洁

排序：

Database and XML Technologies 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Mong Li Lee Jeffrey Xu Yu Zohra Bellahsène Rainer Unland

ISBN: (数字)9783642156847

ISBN: (纸本)9783642156830

Since its first edition in 2003, the XML Database Symposium series (XSym) has been a forum for academics, practitioners, users and vendors, allowing all to discuss the use of and synergy between database management systems and XML. the symposia have provided many opportunities for timely discussions on a broad range of topics pertaining to the theory and practice of XML data management and its applications. XSym 2010 continued this XSym tradition with a program consisting of 11 papers and a keynote shared with the 36th International conference on Very Large Data Bases (VLDB 2010). We received 20 paper submissions, out of which 8 papers were accepted as full papers, and 3 as short papers. Each submitted paper underwent a rigorous and careful review by four referees. the contributions in these proceedings are a fine sample of the current research in XML query processing, including XPath satisfiability, approximate joins, pattern matching, linear index construction for trees, dynamic labeling, and XQuery update translation based on schema. the papers focus on recent advances in detecting fu- tional dependencies, modeling complex XML twig pattern output, promoting sem- tics capability of XML keys, and searchable compression of Microsoft office do- ments. In addition, we include a paper that shares lessons learned from real XML database development.

关键词： Database Management Software Engineering/Programming and Operating Systems Programming Techniques Information Storage and Retrieval Data Structures Algorithm Analysis and Problem Complexity

来源：评论

学校读者我要写书评

暂无评论

A fully dynamic reachability algorithm for directed graphs with an almost linear update time

A fully dynamic reachability algorithm for directed graphs w...

引用

Proceedings of the 36th Annual ACM Symposium on theory of Computing

作者： Roditty, Liam Zwick, Uri School of Computer Science Tel-Aviv University Tel Aviv 69978 Israel

We obtain a new fully dynamic algorithm for the reachability problem in directed graphs. Our algorithm has an amortized update time of O(m+n log n) and a worst-case query time of O(n), where m is the current number of edges in the graph, and n is the number of vertices in the graph. Each update operation either inserts a set of edges that touch the same vertex, or deletes an arbitrary set of edges. the algorithm is deterministic and uses fairly simple data structures. this is the first algorithm that breaks the O(n2) update barrier for all graphs with o(n2) edges. One of the ingredients used by this new algorithm may be interesting in its own right. It is a new dynamic algorithm for strong connectivity in directed graphs with an interesting persistency property. Each insert operation creates a new version of the graph. A delete operation deletes edges from all versions. Strong connectivity queries can be made on each version of the graph. the algorithm handles each update in O(mα(m, n)) amortized time, and each query in O(1) time, where α(m, n) is a functional inverse of Ackermann's function appearing in the analysis of the union-find data structure. Note that the update time of O(mα(m, n)), in case of a delete operation, is the time needed for updating all versions of the graph.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A Robust Random Search Approach for Matching Formulas in Math Information Retrieval Systems 36

A Robust Random Search Approach for Matching Formulas in Mat...

引用

36th IEEE International conference on Tools with Artificial Intelligence, ICTAI 2024

作者： Shellman, Megan Hill, Kate Ng, Yiu-Kai Brigham Young University Computer Science Department ProvoUT United States

ISBN: (纸本)9798331527235

Math is a major contributor to many areas of study, and gives someone skills that (s)he can use across other subjects and different job roles. Unfortunately, a recent study from the National Assessment of Educational Progress shows that no more than 26% of 12th graders in the USA have been rated proficient in math since 2005, and COVID-19 only made the situation worse. In principle, appropriate online searching could promote learning of individual math concepts to help surmount the learning gap. In practice, however, current online searching works poorly for math. While traditional information retrieval systems identify semantically related documents outside of math, such systems were not designed for handling math formulas. Although some work has been done on Mathematical Information Retrieval (MIR) recently, little has focused specifically on developing indexing schemas to quickly search for and retrieve math formulas contained within math questions and answers. the objective of indexing symbols and notations used in math equations is to organize and categorize math information in a way that makes it easier to retrieve and access relevant answers to math questions. To achieve this objective, we propose a robust random search approach for retrieving math information, offering an optimal solution to speed up the process of searching huge volume of math archive. Our design goals of indexing math equations include fast matching math answers to questions, reducing disk input/output, and optimizing the process of solving math questions with suitable answers by enhancing its processing speed. © 2024 IEEE.

关键词： Indexing (materials working)

来源：评论

学校读者我要写书评

暂无评论

On Removing Graded Encodings from Functional Encryption 36th

On Removing Graded Encodings from Functional Encryption

引用

36th Annual International conference on the theory and Applications of Cryptographic Techniques (EUROCRYPT)

作者： Bitansky, Nir Lin, Huijia Paneth, Omer MIT 77 Massachusetts Ave Cambridge MA 02139 USA UCSB Santa Barbara CA 93106 USA

ISBN: (纸本)9783319566146;9783319566139

Functional encryption (FE) has emerged as an outstanding concept. By now, we know that beyond the immediate application to computation over encrypted data, variants with succinct ciphertexts are so powerful that they yield the full might of indistinguishability obfuscation (IO). Understanding how, and under which assumptions, such succinct schemes can be constructed has become a grand challenge of current research in cryptography. Whereas the first schemes were based themselves on IO, recent progress has produced constructions based on constant-degree graded encodings. Still, our comprehension of such graded encodings remains limited, as the instantiations given so far have exhibited different vulnerabilities. Our main result is that, assuming LWE, black-box constructions of sufficiently succinct FE schemes from constant-degree graded encodings can be transformed to rely on a much better-understood object-bilinear groups. In particular, under an uber assumption on bilinear groups, such constructions imply IO in the plain model. the result demonstrates that the exact level of ciphertext succinctness of FE schemes is of major importance. In particular, we draw a fine line between known FE constructions from constant-degree graded encodings, which just fall short of the required succinctness, and the holy grail of basing IO on better-understood assumptions. In the heart of our result, are new techniques for removing ideal graded encoding oracles from FE constructions. Complementing the result, for weaker ideal models, namely the generic group model and the random oracle model, we show a transformation from collusion-resistant FE in either of the two models directly to FE (and IO) in the plain model, without assuming bilinear groups.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

Some afterthoughts on hopfield networks 26th

Some afterthoughts on hopfield networks

引用

26th conference on current trends in theory and practice of Informatics, SOFSEM 1999

作者： Šíma, Jiří Orponen, Pekka Antti-Poika, Teemu Institute of Computer Science Academy of Sciences of the Czech Republic Pod vodárenskou věží 2 Prague 8182 07 Czech Republic Department of Mathematics University of Jyvaskyla P.O. Box 35 JyvaskylaFIN-40351 Finland

ISBN: (纸本)354066694X

In the present paper we investigate four relatively independent issues, which complete our knowledge regarding the computational aspects of popular Hopfield nets. In Section 2 of the paper, the computational equivalence of convergent asymmetric and Hopfield nets is shown with respect to network size. In Section 3, the convergence time of Hopfield nets is analyzed in terms of bit representations. In Section 4, a polynomial time approximate algorithm for the minimum energy problem is shown. In Section 5, the Turing universality of analog Hopfield nets is studied. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Time and space complexity of reversible pebbling 28th

引用

28th International conference on current trends in theory and practice of Informatics, SOFSEM 2001

作者： Kràl’ovič, Richard Department of Computer Science Physics and Informatics Comenius University Bratislava Slovakia

ISBN: (纸本)9783540429128

In the context of quantum computing, reversible computations play an important role. In this paper the model of the reversible pebble game introduced by Bennett is considered. Reversible pebble game is an abstraction of a reversible computation, that allows to examine the space and time complexity for various classes of problems. We present techniques for proving lower and upper bounds on time and space complexity. Using these techniques we show a partial lower bound on time for optimal space (time for optimal space is not o(n lg n)) and a time-space trade off (space O(formula presented) for time 2kn) for a chain of length n. Further, we show a tight optimal space bound (h+Θ(lg∗ h)) for a binary tree of height h and we discuss space complexity for a butterfly. By these results we give an evidence, that for reversible computations more resources are needed with respect to standard irreversible computations. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

Worst case analysis of non-local games

Worst case analysis of non-local games

引用

39th International conference on current trends in theory and practice of computer science, SOFSEM 2013

作者： Ambainis, Andris Bačkurs, Arturs Balodis, Kaspars Škuškovniks, Agnis Smotrovs, Juris Virza, Madars Faculty of Computing University of Latvia Raina bulv. 19 Riga LV-1586 Latvia Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology 32 Vassar Street Cambridge MA 02139 United States

ISBN: (纸本)9783642358425

Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. the players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. the players win if the answers a i satisfy a condition that may depend on the inputs x i . Typically, non-local games are studied in a framework where the referee picks the inputs from a known probability distribution. We initiate the study of non-local games in a worst-case scenario when the referee's probability distribution is unknown and study several non-local games in this scenario. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Developing a foundation for code optimization

引用

13th International conference on Compiler Construction, CC 2004 Held as Part of the Joint European conferences on theory and practice of Software, ETAPS 2004

作者： Soffa, Mary Lou Department of Computer Science University of Pittsburgh PittsburghPA United States

ISBN: (纸本)3540212973

Although optimization technology has been successful over the past 40 years, recent trends are emerging that demand we reconsider the paradigm that we are using for code optimization. In particular, the trends toward dynamic optimization, writing embedded system software in high level languages and the lack of significant performance improvement from current optimization research are forcing us to rethink what we know and do not know about optimization. A number of problems dealing with both semantic and application properties of optimizations have always existed but have been mostly ignored. the challenge in optimization today is to explore properties of optimizations and develop a framework for better understanding and use of optimizations. Fortunately, research is starting to explore properties, including proving the soundness of optimizations, proving the correctness of optimizations, specifications of optimizations, and the predictability of profits of optimizations. Not only must we understand the properties, but we also need to integrate the properties into a framework. Only then can we address the problems of the developing trends. © Springer-Verlag Berlin Heidelberg 2004.

关键词： High level languages

来源：评论

学校读者我要写书评

暂无评论

Fuzzy group models for adaptation in cooperative information retrieval contexts

引用

30th conference on current trends in theory and practice of computer science, SOFSEM 2004

作者： Sicilia, Miguel-Ángel García, Elena Computer Science Department Polytechnic School University of Alcalá Ctra. Barcelona km. 33.6 Alcalá de HenaresMadrid28871 Spain

ISBN: (纸本)3540207791

Cooperation in information retrieval contexts can be used to share query results inside groups of individuals with common objectives, provided that all of them are aware of each other. the strength of the social relationships between group members is in most cases a matter of comparative degree, and thus relationships can be modelled through fuzzy conceptual associations. these associations can then be used to implement personalized features, aimed at improving the interaction of the user with the query tool. In this paper, an approach to modelling imprecise relationships between users in the context of information retrieval is described, along with a concrete case study implemented as a wrapper of a conventional search engine, using a fuzzy database to store the model of the group members. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Rough Sets and Intelligent Systems Paradigms 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Marzena Kryszkiewicz Zbigniew W. Raś Chris Cornelis Davide Ciucci Jesús Medina-Moreno Hiroshi Motoda

ISBN: (数字)9783319087290

ISBN: (纸本)9783319087283

this book constitutes the refereed proceedings of the 23rd Australasian Joint conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2014, held in Granada and Madrid, Spain, in July 2014. RSEISP 2014 was held along with the 9th International conference on Rough Sets and current trends in Computing, RSCTC 2014, as a major part of the 2014 Joint Rough Set Symposium, JRS 2014. JRS 2014 received 40 revised full papers and 37 revised short papers which were carefully reviewed and selected from 120 submissions and presented in two volumes. this volume contains the papers accepted for the conference RSEISP 2014, as well as the three invited papers presented at the conference. the papers are organized in topical sections on plenary lecture and tutorial papers; foundations of rough set theory; granular computing and covering-based rough sets; applications of rough sets; induction of decision rules - theory and practice; knowledge discovery; spatial data analysis and spatial databases; information extraction from images.

关键词： Artificial Intelligence Data Mining and Knowledge Discovery Mathematical Logic and Formal Languages Information Systems Applications (incl. Internet) Information Storage and Retrieval Pattern Recognition

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共26页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：