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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

188 篇 会议
15 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

141 篇 工学
- 135 篇 计算机科学与技术...
- 51 篇 软件工程
- 21 篇 信息与通信工程
- 15 篇 电气工程
- 9 篇 控制科学与工程
- 6 篇 网络空间安全
- 4 篇 化学工程与技术
- 3 篇 建筑学
- 3 篇 土木工程
- 2 篇 机械工程
- 2 篇 测绘科学与技术
- 2 篇 轻工技术与工程
- 2 篇 生物医学工程（可授...
- 1 篇 光学工程
56 篇 理学
- 44 篇 数学
- 9 篇 物理学
- 5 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 生物学
- 2 篇 系统科学
18 篇 管理学
- 16 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 2 篇 工商管理
3 篇 法学
- 3 篇 社会学
- 1 篇 法学
3 篇 教育学
- 3 篇 教育学
3 篇 医学
- 3 篇 基础医学(可授医学...
- 3 篇 临床医学
- 2 篇 药学(可授医学、理...
1 篇 文学
- 1 篇 新闻传播学

主题

13 篇 graph theory
9 篇 artificial intel...
8 篇 automata theory
7 篇 discrete mathema...
6 篇 theory of comput...
6 篇 computers
5 篇 computer communi...
4 篇 software enginee...
4 篇 software enginee...
4 篇 algorithm analys...
4 篇 information stor...
3 篇 turing machines
3 篇 database managem...
3 篇 game theory
3 篇 complexity theor...
3 篇 software
3 篇 computer program...
3 篇 information retr...
2 篇 data storage rep...
2 篇 computer science

机构

3 篇 university of be...
2 篇 department of co...
2 篇 charles universi...
2 篇 department of co...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 dept. of compute...
2 篇 school of comput...
2 篇 university of li...
2 篇 institute of com...
2 篇 the institute of...
2 篇 university of am...
2 篇 department of in...
2 篇 central universi...
2 篇 department of co...
2 篇 school of comput...
1 篇 university of ca...
1 篇 faculty of elect...
1 篇 cern 1 esplanade...
1 篇 ist austria klos...

作者

3 篇 van leeuwen jan
3 篇 šíma jiří
3 篇 saurabh saket
2 篇 peleg david
2 篇 zhaoquan gu
2 篇 bieliková mária
2 篇 žák stanislav
2 篇 ono hirotaka
2 篇 mária bieliková
2 篇 leszek pacholski
2 篇 freivalds rūsiņš
2 篇 shaohua wang
2 篇 paulusma daniel
2 篇 inenaga shunsuke
2 篇 xinchen wang
2 篇 kiya hironori
2 篇 rossmanith peter
2 篇 wiedermann jiri
2 篇 pokorný jaroslav
2 篇 iliopoulos costa...

语言

206 篇 英文
4 篇 中文

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

共 210 条记录，以下是121-130 订阅

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

详细简洁

排序：

29th conference on current trends in theory and practice of Informatics, SOFSEM 2002

29th Conference on Current Trends in Theory and Practice of ...

引用

29th conference on current trends in theory and practice of Informatics, SOFSEM 2002

ISBN: (纸本)354000145X

the proceedings contain 22 papers. the special focus in this conference is on System Design, Testing Related theory, Parallel Systems and Vision. the topics include: Conformance testing techniques for timed systems;counter-constrained finite state machines;a new model for component protocols with resource-dependencies;equivalence-checking with infinite-state systems;database support for multisource multiresolution scientific data;semantic annotation and indexing of news and sports videos;interactive indexing and retrieval of multimedia content;a model-based approach to semantic-based retrieval of visual information;bipolarity in possibilistic logic and fuzzy rules;data management challenges for grid computing;Hungarian speech synthesis using a phase exact HNM approach;modelling resource transitions in constraint-based scheduling;a specification framework for real- time scheduling;validation and decomposition of partially occluded images;solving conflicts of agent knowledge states in multiagent systems;specification and verification of secure business transaction systems;agent- oriented model of simulated evolution;the reconstruction of some 3d convex polyominoes from orthogonal projections and the complexity of probabilistic versus quantum finite automata.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On Contracting Graphs to Fixed Pattern Graphs

On Contracting Graphs to Fixed Pattern Graphs

引用

36th conference on current trends in theory and practice of computer science

作者： van't Hof, Pim Kaminski, Marcin Paulusma, Daniel Szeider, Stefan thilikos, Dimitrios M. Univ Durham Sch Engn & Comp Sci Sci Labs South Rd Durham DH1 3LE England Univ Libre Bruxelles Dept Comp Sci B-1050 Brussels Belgium Natl & Kapodistrian Univ Athens Dept Math GR-15784 Athens Greece

ISBN: (纸本)9783642112652

For a fixed graph H, the H-CONTRACTIBILITY problem asks if a graph is H-contractible, i.e., can be transformed into H via a series of edge contractions. the computational complexity classification of tins problem is still open. So far, H has a dominating vertex in all cases known to be polynomially solvable, whereas H does not have such a vertex in all cases known to be NP-complete. Here, we present a class of graphs H with a dominating vertex for which H-CONTRACTIBILITY is NP-complete. We also present a new class of graphs H for which H-CONTRACTIBILITY is polynomially solvable. Furthermore, we study the (H,v)-CONTRACTIBILITY problem, where v is a vertex of H. the input of this problem is a graph G and an integer k. the question is whether G is H-contractible such that the "bag" of G corresponding to v contains at least k vertices. We show that this problem is NP-complete whenever H is connected and v is not a dominating vertex of H.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Crowd Detection for Drone Safe Landing through Fully-Convolutional Neural Networks 46th

Crowd Detection for Drone Safe Landing Through Fully-Convolu...

引用

46th International conference on current trends in theory and practice of Informatics (SOFSEM)

作者： Castellano, Giovanna Castiello, Ciro Mencar, Corrado Vessio, Gennaro Univ Bari Dept Comp Sci Bari Italy

ISBN: (纸本)9783030389192;9783030389185

In this paper, we propose a novel crowd detection method for drone safe landing, based on an extremely light and fast fully convolutional neural network. Such a computer vision application takes advantage of the technical tools some commercial drones are equipped with. the proposed architecture is based on a two-loss model in which the main classification task, aimed at distinguishing between crowded and non-crowded scenes, is simultaneously assisted by a regression task, aimed at people counting. In addition, the proposed method provides class activation heatmaps, useful to semantically augment the flight maps. To evaluate the effectiveness of the proposed approach, we used the challenging VisDrone dataset, characterized by a very large variety of locations, environments, lighting conditions, and so on. the model developed by the proposed two-loss deep architecture achieves good values of prediction accuracy and average precision, outperforming models developed by a similar one-loss architecture and a more classic scheme based on MobileNet. Moreover, by lowering the confidence threshold, the network achieves very high recall, without sacrificing too much precision. the method also compares favorably with the state-of-the-art, providing an effective and efficient tool for several safe drone applications.

关键词： Unmanned aerial vehicles Crowd detection Public safety Safe landing computer vision Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

27th conference on current trends in theory and practice of Informatics, SOFSEM 2000

引用

27th conference on current trends in theory and practice of Informatics, SOFSEM 2000

ISBN: (纸本)3540413480

the proceedings contain 35 papers. the special focus in this conference is on trends in Algorithmics and Information Technologies in practice. the topics include: A software engineering discipline in need of research;exhaustive search, combinatorial optimization and enumeration;the incompressibility method;algorithms for rational agents;simplified witness tree arguments;physical design of CMOS chips in six easy steps;analysis patterns;information society technologies in healthcare;towards high speed grammar induction on large text corpora;information access based on associative calculation;exploiting ecological niche and morphology;hierarchies of sensing and control in visually guided agents;recognizing objects by their appearance using eigenimages;applications in image processing;an automatic composition algorithm for functional logic programs;on the approximation ratio of the group-merge algorithm for the shortest common superstring problem;fast evolutionary chains;a temporal layered knowledge architecture for an evolving structured environment;on-line maximum-order induced hereditary subgraph problems;quantum pushdown automata;use of dependency microcontexts in information retrieval;some notes on the information flow in read-once branching programs;on vision-based orientation method of a robot head in a dark cylindrical pipe;autonomous components;parallel object server for fine grained objects;massively parallel pattern recognition with link failures;finitary observations in regular algebras and using consensus methods for solving conflicts of data in distributed systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SOFSEM 2000: theory and practice of Informatics 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Václav Hlaváč Keith G. Jeffery Jiří Wiedermann

ISBN: (数字)9783540444114

ISBN: (纸本)9783540413486

the international conference on current trends in the theory and practice of informatics SOFSEM 2000 was held 25 November–2 December 2000 in the c- ference facilities of the Dev?et Skal (Nine Rocks) Hotel, Milovy, Czech-Moravian Highlands, the Czech Republic. It was already the 27th annual meeting in the series of SOFSEM conferences organized in either the Czech or the Slovak Rep- lic. Since its establishment in 1974, SOFSEM has gone through a long dev- opment in parallel with the entire ?eld of informatics. currently SOFSEM is a wide-scope, multidisciplinary conference, with stress on the interplay between the theory and practice of informatics. the SOFSEM scienti?c program consists mainly of invited talks which determine the topics of the conference. Invited talks are complemented by short refereed talks contributed by SOFSEM parti- pants. the topics of invited talks are chosen so as to cover the span from theory to practice and to bring interesting research areas to the attention of conf- ence participants. For the year 2000, the following three streams were chosen for presentation by the SOFSEM Steering Committee: – trends in Algorithmics – Information Technologies in practice – Computational Perception the above streams were covered through 16 invited talks given by prominent researchers. there were 18 contributed talks also presented, chosen by the int- national Program Committee from among 36 submitted papers. the program also included a panel on lessons learned from the Y2K problem.

关键词： theory of Computation Software Engineering/Programming and Operating Systems Artificial Intelligence Information Storage and Retrieval computer Communication Networks

来源：评论

学校读者我要写书评

暂无评论

Bounding Lamport’s bakery algorithm 28th

引用

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

作者： Jayanti, Prasad Tan, King Friedland, Gregory Katz, Amir 6211 Sudikoff Lab for Computer Science Dartmouth College HanoverNH03755 United States

ISBN: (纸本)9783540429128

Lamport’s Bakery algorithm is among the best known mutual exclusion algorithms. A drawback of Lamport’s algorithm is that it requires unbounded registers for communication among processes. By making a small modification to Lamport’s algorithm, we remove the need for unbounded registers. the main appeal of our algorithm lies in the fact that it overcomes a drawback of a famous algorithm while preserving its elegance. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

How to employ reverse search in distributed single source shortest paths 28th

引用

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

作者： Brim, Luboš Černá, Ivana Krčál, Pavel Pelánek, Radek Department of Computer Science Masaryk University Brno Czech Republic

ISBN: (纸本)9783540429128

A distributed algorithm for the single source shortest path problem for directed graphs with arbitrary edge lengths is proposed. the new algorithm is basedon relaxations anduses reverse search for inspecting edges and thus avoids using any additional data structures. At the same time the algorithm uses a novel way to recognize a reachable negative-length cycle in the graph which facilitates the scalability of the algorithm. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

An Analysis of NIST SP 800-90A 38th

An Analysis of NIST SP 800-90A

引用

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

作者： Woodage, Joanne Shumow, Dan Royal Holloway Univ London Egham Surrey England Microsoft Res Redmond WA USA

ISBN: (纸本)9783030176563;9783030176556

We investigate the security properties of the three deterministic random bit generator (DRBG) mechanisms in NIST SP 800-90A [2]. the standard received considerable negative attention due to the controversy surrounding the now retracted DualEC-DRBG, which appeared in earlier versions. Perhaps because of the attention paid to the DualEC, the other algorithms in the standard have received surprisingly patchy analysis to date, despite widespread deployment. this paper addresses a number of these gaps in analysis, with a particular focus on HASH-DRBG and HMAC-DRBG. We uncover a mix of positive and less positive results. On the positive side, we prove (with a caveat) the robustness [13] of HASH-DRBG and HMAC-DRBG in the random oracle model (ROM). Regarding the caveat, we show that if an optional input is omitted, then contrary to claims in the standard HMAC-DRBG does not even achieve the (weaker) property of forward security. We then conduct a more informal and practice-oriented exploration of flexibility in the standard. Specifically, we argue that these DRBGs have the property that partial state leakage may lead security to break down in unexpected ways. We highlight implementation choices allowed by the overly flexible standard that exacerbate both the likelihood, and impact, of such attacks. While our attacks are theoretical, an analysis of two open source implementations of CTR-DRBG shows that these potentially problematic implementation choices are made in the real world.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Quantum finite state transducers 28th

引用

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

作者： Freivalds, Rūsiņš Winter, Andreas Institute of Mathematics and Computer Science University of Latvia Raiņa bulvāris 29 RigaLV–1459 Latvia Department of Computer Science University of Bristol Merchant Venturers Building Woodland Road BristolBS8 1UB United Kingdom

ISBN: (纸本)9783540429128

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their ‘little brothers’, the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. this we show by discussing a number of characteristic examples. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Transducers

来源：评论

学校读者我要写书评

暂无评论

Graphs Cannot Be Indexed in Polynomial Time for Sub-quadratic Time String Matching, Unless SEth Fails 47th

Graphs Cannot Be Indexed in Polynomial Time for Sub-quadrati...

引用

47th International conference on current trends in theory and practice of computer science (SOFSEM)

作者： Equi, Massimo Makinen, Veli Tomescu, Alexandru, I Univ Helsinki Dept Comp Sci Helsinki Finland

ISBN: (纸本)9783030677305;9783030677312

the string matching problem on a node-labeled graph G = (V, E) asks whether a given pattern string P has an occurrence in G, in the form of a path whose concatenation of node labels equals P. this is a basic primitive in various problems in bioinformatics, graph databases, or networks, but only recently proven to have a O(vertical bar E vertical bar P vertical bar)-time lower bound, under the Orthogonal Vectors Hypothesis (OVH). We consider here its indexed version, in which we can index the graph in order to support time-efficient string queries. We show that, under OVH, no polynomial-time indexing scheme of the graph can support querying P in time O(vertical bar P vertical bar+vertical bar E vertical bar d vertical bar P vertical bar(beta)), with either delta < 1 or beta < 1. As a side-contribution, we introduce the notion of linear independent-components (lic) reduction, allowing for a simple proof of our result. As another illustration that hardness of indexing follows as a corollary of a lic reduction, we also translate the quadratic conditional lower bound of Backurs and Indyk (STOC 2015) for the problem of matching a query string inside a text, under edit distance. We obtain an analogous tight quadratic lower bound for its indexed version, improving the recent result of Cohen-Addad, Feuilloley and Starikovskaya (SODA 2019), but with a slightly different boundary condition.

关键词： Exact pattern matching Indexing Orthogonal vectors Complexity theory Reductions Lower bounds Edit distance Graph query

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：