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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是71-80 订阅

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

详细简洁

排序：

Taming of Pict 1

引用

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

作者： Kosik, Matej Slovak Univ Technol Bratislava Fac Informat & Informat Technol Bratislava Slovakia

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

this article presents additional necessary measures that enable us to use Pict as an object-capability programing language. It is desirable to be able to assess the worst possible threat that we-users-risk if we run a given program. If we know the threat, we are able to decide whether or not we are willing to risk running the program. the cost of a security audit that reveals such an assessment will be non-zero but it need not to be directly dependent on the size of the whole original program. It is possible to write programs in such a way that this analysis can be reliably performed on a fraction of the original program-on the trusted computing base. this technique does not always give the most accurate assessment but it gives sound and interesting assessment relatively cheaply. It does not prevent usage of other techniques that can further refine the initial assessment.

关键词： computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Privacy, Liveliness and Fairness for Reputation

Privacy, Liveliness and Fairness for Reputation

引用

37th International conference on current trends in theory and practice of computer science, SOFSEM 2011

作者： Schiffner, Stefan Clauss, Sebastian Steinbrecher, Sandra Katholieke Univ Leuven ESAT SCD COSIC & IBBT Kasteelpk Arenberg 10 B-3001 Louvain Belgium Tech Univ Dresden Inst Sys Architecture D-01062 Dresden Germany

ISBN: (纸本)9783642183805

In various Internet applications, reputation systems are typical means to collect experiences users make with each other. We present a reputation system that balances the security and privacy requirements of all users involed. Our system provides privacy in the form of information theoretic relationship anonymity w.r.t. users and the reputation provider. Furthermore, it preserves liveliness, i.e., all past ratings can influence the current reputation profile of a user. In addition, mutual ratings are forced to be simultaneous and self rating is prevented, which enforces fairness. What is more, without performing mock interactions-even if all users are colluding-users cannot forge ratings. As far as we know, this is the first protocol proposed that fulfills all these properties simultaneously.

关键词： Information theory

来源：评论

学校读者我要写书评

暂无评论

A model of an amorphous computer and its communication protocol

A model of an amorphous computer and its communication proto...

引用

33rd conference on current trends in theory and practice of computer science

作者： Petru, Lukas Wiedermann, Jiri Charles Univ Prague Fac Math & Phys Malostranske Namesti 25 CR-11800 Prague 1 Czech Republic Acad Sci Czech Republic Inst Comp Sci Prague 18207 Czech Republic

ISBN: (纸本)9783540695066

We design a formal model of an amorphous computer suitable for theoretical investigation of its computational properties. the model consists of a finite set of nodes created by RAMs with restricted memory, which are dispersed uniformly in a given area. Within a limited radius the nodes can communicate with their neighbors via a single-channel radio. the assumptions on low-level communication abilities are among the weakest possible: the nodes work asynchronously, there is no broadcasting collision detection mechanism and no network addresses. For the underlying network we design a randomized communication protocol and analyze its efficiency. the subsequent experiments and combinatorial analysis of random networks show that the expectations under which our protocol was designed are met by the vast majority of the instances of our amorphous computer model.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

On the Difference Between Finite-State and Pushdown Depth 46th

On the Difference Between Finite-State and Pushdown Depth

引用

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

作者： Jordon, Liam Moser, Philippe Natl Univ Ireland Maynooth Comp Sci Dept Maynooth Kildare Ireland

ISBN: (纸本)9783030389192;9783030389185

this paper expands upon existing and introduces new formulations of Bennett's logical depth. A new notion based on pushdown compressors is developed. A pushdown deep sequence is constructed. the separation of (previously published) finite-state based and pushdown based depth is shown. the previously published finite state depth notion is extended to an almost everywhere (a.e.) version. An a.e. finite-state deep sequence is shown to exist along with a sequence that is infinitely often (i.o.) but not a.e. finite-state deep. For both finite-state and pushdown, easy and random sequences with respect to each notion are shown to be non-deep, and that a slow growth law holds for pushdown depth.

关键词： Algorithmic information theory Kolmogorov complexity Bennett's logical depth

来源：评论

学校读者我要写书评

暂无评论

theory of Multi Core Hypervisor Verification

Theory of Multi Core Hypervisor Verification

引用

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

作者： Cohen, Ernie Paul, Wolfgang Schmaltz, Sabine Microsoft Corp Redmond WA 98052 USA Univ Saarland D-66123 Saarbrucken Germany

ISBN: (纸本)9783642358432

From 2007 to 2010, researchers from Microsoft and the Verisoft XT project verified code from Hyper-V, a multi-core x-64 hypervisor, using VCC, a verifier for concurrent C code. However, there is a significant gap between code verification of a kernel (such as a hypervisor) and a proof of correctness of a real system running the code. When the project ended in 2010, crucial and tricky portions of the hypervisor product were formally verified, but one was far from having an overall theory of multi core hypervisor correctness even on paper. For example, the kernel code itself has to set up low-level facilities such as its call stack and virtual memory map, and must continue to use memory in a way that justifies the memory model assumed by the compiler and verifier, even though these assumptions are not directly guaranteed by the hardware. Over the last two years, much of the needed theory justifying the approach has been worked out. We survey progress on this theory and identify the work that is left to be done.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Extension of rescheduling based on minimal graph cut 1

引用

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

作者： Lekavy, Marian Navrat, Pavel Slovak Tech Univ Bratislava Fac Informat & Informat Technol Bratislava 84216 Slovakia

ISBN: (数字)9783540775669

ISBN: (纸本)9783540775652

An important role of a workflow system is to schedule and reschedule the workflow process and to allow the user to monitor and guide the overall progress of the workflow and its activities. this paper presents extensions of a rescheduling algorithm based on minimal graph cut. the initial approach allowed to find an optimal rescheduling, which changed the initial schedule by shortening and moving of activities. the new schedule had the lowest overall price, counted as the sum of prices of shortening activities. the extension presented in this paper allows several extensions, while keeping the optimality: handling several delayed activities, handling the price of moving an activity and handling the price of deadline violation. the rescheduling algorithm is used within an ontology-based workflow management system for the process of military exercise preparation in Centre of simulation technologies National Academy of Defence.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Querying and viewing the Semantic Web: An RDF-based perspective

引用

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

作者： Plexousakis, D Department of Computer Science University of Crete and Institute of Computer Science Foundation for Research and Technology Hellas Greece

ISBN: (纸本)3540207791

Real-scale Semantic Web applications, such as Knowledge Portals and E-Marketplaces, require the management of voluminous repositories of resource metadata. At the same time, personalized access and content syndication involving diverse conceptual representations of information resources are key challenges for such applications. the Resource Description Framework (RDF) enables the creation and exchange of metadata as any other Web data and constitutes nowadays the core language for creating and exchanging resource descriptions worldwide. Although large volumes of RDF descriptions are already appearing, sufficiently expressive declarative query languages for RDF and full-fledged view definition languages are still missing.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

On the Complexity of Optimal Matching Reconfiguration 1

引用

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

作者： Gupta, Manoj Kumar, Hitesh Misra, Neeldhara Indian Inst Technol Gandhinagar Gandhinagar India NISER Bhubaneswar Bhubaneswar India

ISBN: (数字)9783030108014

ISBN: (纸本)9783030108014;9783030108007

We consider the problem of matching reconfiguration, where we are given two matchings M-s and M-t in a graph G and the goal is to determine if there exists a sequence of matchings M-0, M-1,..., M-l, such that M-0 = M-s, all consecutive matchings differ by exactly two edges (specifically, any matching is obtained from the previous one by the addition and deletion of one edge), and M-l = M-t. It is known that the existence of such a sequence can be determined in polynomial time [5]. We extend the study of reconfiguring matchings to account for the length of the reconfiguration sequence. We show that checking if we can reconfigure M-s to M-t in at most l steps is NP-hard, even when the graph is unweighted, bipartite, and the maximum degree is four, and the matchings M-s and M-t are maximum matchings. We propose two simple algorithmic approaches, one of which improves on the brute-force running time while the other is a SAT formulation that we expect will be useful in practice.

关键词： Graph theory Reconfiguration Matchings NP-hardness

来源：评论

学校读者我要写书评

暂无评论

Deciding the Value 1 Problem for #-acyclic Partially Observable Markov Decision Processes

Deciding the Value 1 Problem for #-acyclic Partially Observa...

引用

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

作者： Gimbert, Hugo Oualhadj, Youssouf CNRS LaBRI F-75700 Paris France Aix Marseille Univ CNRS LIF Marseille France Univ Mons Mons Belgium

ISBN: (纸本)9783319042978;9783319042985

the value 1 problem is a natural decision problem in algorithmic game theory. For partially observable Markov decision processes with reachability objective, this problem is defined as follows: are there observational strategies that achieve the reachability objective with probability arbitrarily close to 1? this problem was shown undecidable recently. Our contribution is to introduce a class of partially observable Markov decision processes, namely #-acyclic partially observable Markov decision processes, for which the value 1 problem is decidable. Our algorithm is based on the construction of a two-player perfect information game, called the knowledge game, abstracting the behaviour of a #-acyclic partially observable Markov decision process M such that the first player has a winning strategy in the knowledge game if and only if the value of M is 1.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Towards Minimally Conscious Cyber-Physical Systems: A Manifesto 47th

Towards Minimally Conscious Cyber-Physical Systems: A Manife...

引用

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

作者： Wiedermann, Jiri van Leeuwen, Jan Czech Acad Sci Inst Comp Sci Prague Czech Republic Karel Capek Ctr Values Sci & Technol Prague Czech Republic Univ Utrecht Dept Informat & Comp Sci Utrecht Netherlands

ISBN: (纸本)9783030677305;9783030677312

Incidents like the crash of Lion Air Flight 610 in 2018 challenge the design of reliable and secure cyber-physical systems that operate in the real-world and have to cope with unpredictable external phenomena and error-prone technology. We argue that their design needs to guarantee minimal machine consciousness, which expresses that these systems must operate with full awareness of (the state of) their components and the environment. the concept emerged from our recent effort to develop a computational model for conscious behavior in robots, based on the theory of automata. Making systems `minimal machine conscious' leads to more trustworthy systems, as it strengthens their behavioral flexibility in varying environments and their resilience to operation and cooperation failures of their components and as a whole. the notion of minimal machine consciousness has the potential to become one of the defining attributes of Industry 4.0.

关键词： Automata theory Cyber-physical systems Design philosophy Industry 4.0 Minimal machine consciousness SACA loop Self-control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：