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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

214 篇 电子文献
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 篇 mila - quebec ai...
2 篇 charles universi...
2 篇 department of co...
2 篇 dept. of compute...
2 篇 warsaw universit...
2 篇 schulich school ...
2 篇 department of co...
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 篇 zhejiang lab
2 篇 central universi...
2 篇 department of co...
2 篇 school of comput...

作者

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...

语言

211 篇 英文
4 篇 中文

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

共 215 条记录，以下是91-100 订阅

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

详细简洁

排序：

Rough Sets and Intelligent Systems Paradigms: Second International conference, RSEISP 2014, Held as Part of JRS 2014, Granada and Madrid, Spain, July 9-13, 2014. Proceedings 1

引用

丛书名： Lecture Notes in computer science 8537 Lecture Notes in Artificial Intelligence

2014年

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

ISBN: (数字)9783319087290

ISBN: (纸本)9783319087283;9783319087290

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language theory

引用

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

作者： Anselmo, Marcella Giammarresi, Dora Madonia, Maria Univ Salerno Dipartimento Informat I-84084 Fisciano SA Italy Univ Roma Tor Vergata Dipartimento Matemat I-00133 Rome Italy Univ Catania Dip Matemat & Informat I-95125 Catania Italy

ISBN: (纸本)9783642358432

We define two-dimensional rational automata for pictures as an extension of classical finite automata for strings. they are obtained replacing the finite relation computed by the transition function with a rational relation computed by a transducer. the model provides a uniform setting for the most important notions, techniques and results presented in the last decades for recognizable two-dimensional languages, and establishes new connections between one- and two-dimensional language theory.

关键词： Rational functions

来源：评论

学校读者我要写书评

暂无评论

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

SOFSEM 2011: Theory and Practice of Computer Science - 37th ...

引用

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

ISBN: (纸本)9783642183805

the proceedings contain 45 papers. the topics discussed include: integrity and consistency for untrusted services;a structured codesign approach to many-core architectures for embedded systems;efficient algorithms for handling nondeterministic automata;tracking the evolution of code clones;liquidsoap: a high-level programming language for multimedia streaming;combining traditional map labeling with boundary labeling;on making a distinguished vertex minimum degree by vertex deletion;sequential optimization of matrix chain multiplication relative to different cost functions;collisionless gathering of robots with an extent;min-max coverage in multi-interface networks;bandwidth constrained multi-interface networks;cooperative query answering by abstract interpretation;a power consumption analysis technique using UML-based design models in embedded software development;and advice complexity and barely random algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Risk Analysis for Trust and Reputation Systems

引用

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

作者： Boreale, Michele Celestini, Alessandro Univ Florence I-50121 Florence Italy IMT Inst Adv Studies Lucca Piazza S Ponziano 6 I-55100 Lucca Italy

ISBN: (纸本)9783642358432

Trust and reputation systems are decision support tools used to drive parties' interactions on the basis of parties' reputation. In such systems, parties rate with each other after each interaction. Reputation scores for each ratee are computed via reputation functions on the basis of collected ratings. We propose a general framework based on Bayesian decision theory for the assessment of such systems, with respect to the number of available ratings. Given a reputation function g and n independent ratings, one is interested in the value of the loss a user may incur by relying on the ratee's reputation as computed by the system. To this purpose, we study the behaviour of both Bayes and frequentist risk of reputation functions with respect to the number of available observations. We provide results that characterise the asymptotic behaviour of these two risks, describing their limits values and the exact exponential rate of convergence. One result of this analysis is that decision functions based on Maximum-Likelihood are asymptotically optimal. We also illustrate these results through a set of numerical simulations.

关键词： trust reputation information theory Bayesian decision theory

来源：评论

学校读者我要写书评

暂无评论

An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions

引用

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

作者： Kante, Mamadou Moustapha Laforest, Christian Momege, Benjamin Univ Blaise Pascal Clermont Univ LIMOS CNRS Clermont Ferrand France

ISBN: (纸本)9783642358432

A graph with forbidden transitions is a pair (G, F-G) where G := (V-G, E-G) is a graph and FG is a subset of the set {({y, x}, {x, z}) epsilon E-G(2)}. A path in a graph with forbidden transitions (G, F-G) is a path in G such that each pair ({y, x}, {x, z}) of consecutive edges does not belong to FG. It is shown in [S. Szeider, Finding paths in graphs avoiding forbidden transitions, DAM 126] that the problem of deciding the existence of a path between two vertices in a graph with forbidden transitions is Np-complete. We give an exact exponential time algorithm that decides in time O(2(n) center dot n(5) center dot log(n)) whether there exists a path between two vertices of a given n-vertex graph with forbidden transitions. We also investigate a natural extension of the minimum cut problem: we give a polynomial time algorithm that computes a set of forbidden transitions of minimum size that disconnects two given vertices (while in a minimum cut problem we are seeking for a minimum number of edges that disconnect the two vertices). the polynomial time algorithm for that second problem is obtained via a reduction to a standard minimum cut problem in an associated allowed line graph.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

4th International workshop on Emerging trends in Software Metrics (WETSoM 2013)

4th International workshop on Emerging Trends in Software Me...

引用

International conference on Software Engineering (ICSE)

作者： Steven Counsell Ewan Tempero Michele L. Marchesi Aaron Visaggio Department of Information Systems and Computing Brunel University London UK Department of Electrical and Electronic Engineering University of Cagliari Cagliari Italy Department of Computer Science University of Auckland Auckland New Zealand Department of Engineering University of Sannio Benevento Italy

ISBN: (纸本)9781467330756

the International Workshop on Emerging trends in Software Metrics aims at gathering together researchers and practitioners to discuss the progress of software metrics. the motivation for this workshop is the low impact that software metrics has on current software development. the goals of this workshop includes critically examining the evidence for the effectiveness of existing metrics and identifying new directions for metrics. Evidence for existing metrics includes how the metrics have been used in practice and studies showing their effectiveness. Identifying new directions includes use of new theories, such as complex network theory, on which to base metrics.

关键词： Educational institutions Software metrics conferences Software Market research Complex networks

来源：评论

学校读者我要写书评

暂无评论

4-Coloring H-Free Graphs When H Is Small

4-Coloring H-Free Graphs When H Is Small

引用

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

作者： Golovach, Petr A. Paulusma, Daniel Song, Jian Univ Durham Sch Engn & Comp Sci Sci Labs Durham DH1 3LE England

ISBN: (纸本)9783642276590;9783642276606

the k-COLORING problem is to test whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. If a graph C does not contain a graph H as an induced subgraph, then C is called H-free. For any fixed graph H on at most 6 vertices, it is known that 3-COLORING is polynomial-time solvable on H-free graphs whenever H is a linear forest and NP-complete otherwise. By solving the missing case P-2+P-3, we prove the same result for 4-COLORING provided that H is a fixed graph on at most 5 vertices.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A Turing machine resisting isolated bursts of faults

A Turing machine resisting isolated bursts of faults

引用

38th conference on current trends in theory and practice of computer science, SOFSEM 2012

作者： Çapuni, Ilir Gács, Peter Boston University Department of Computer Science 111 Cummington str Boston MA 02215 United States

ISBN: (纸本)9783642276590

We consider computations of a Turing machine under noise that causes consecutive violations of the machine's transition function. Given a constant upper bound β on the size of bursts of faults, we construct a Turing machine M(β) subject to faults that can simulate any fault-free machine under the condition that bursts not closer to each other than V for an appropriate V = O(β). © 2012 Springer-Verlag.

关键词： Turing machines

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：