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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

156 篇 会议
14 篇 期刊文献
7 册 图书

馆藏范围

175 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

146 篇 工学
- 138 篇 计算机科学与技术...
- 100 篇 软件工程
- 13 篇 电气工程
- 13 篇 信息与通信工程
- 10 篇 控制科学与工程
- 5 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 轻工技术与工程
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
56 篇 理学
- 52 篇 数学
- 6 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 生物学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 大气科学
- 1 篇 地球物理学
10 篇 管理学
- 9 篇 图书情报与档案管...
2 篇 医学
- 2 篇 基础医学(可授医学...
- 1 篇 临床医学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学
1 篇 农学
- 1 篇 作物学

主题

11 篇 semantics
9 篇 computer softwar...
7 篇 software enginee...
7 篇 system analysis
6 篇 artificial intel...
5 篇 model checking
4 篇 data structures
4 篇 congresses.
3 篇 computer science
3 篇 formal languages
3 篇 specifications
3 篇 differentiation ...
2 篇 program debuggin...
2 篇 mobile computati...
2 篇 congruence resul...
2 篇 formal logic
2 篇 computational co...
2 篇 fault tolerance
2 篇 computability an...
2 篇 routing expressi...

机构

4 篇 max planck inst ...
3 篇 max planck inst ...
3 篇 univ leicester d...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 univ london impe...
2 篇 univ bologna dip...
2 篇 cwi dept softwar...
2 篇 univ warwick dep...
2 篇 queen mary univ ...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...
2 篇 univ oxford dept...
2 篇 imdea software i...
2 篇 univ paris 07 li...
2 篇 univ london quee...
2 篇 liacs leiden uni...
2 篇 univ illinois ch...
2 篇 rhein westfal th...
1 篇 univ bologna dep...

作者

3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 chistikov dmitry
3 篇 o'hearn p
2 篇 ulidowski irek
2 篇 rabinovich alexa...
2 篇 busi n
2 篇 sagiv mooly
2 篇 haase christoph
2 篇 furio honsell
2 篇 kurz alexander
2 篇 aceto luca
2 篇 pfenning frank
2 篇 boneva i
2 篇 plump detlef
2 篇 mogens nielsen
2 篇 meyer antoine
2 篇 phillips iain
2 篇 schmuck anne-kat...
2 篇 bonsangue marcel...

语言

168 篇 英文
5 篇 其他
4 篇 中文

检索条件"任意字段=4th International Conference on Foundations of Software Science and Computation Structures"

共 177 条记录，以下是61-70 订阅

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

详细简洁

排序：

Wisent: Robust Downstream Communication and Storage for computational RFIDs 35

Wisent: Robust Downstream Communication and Storage for Comp...

引用

35th IEEE Annual international conference on Computer Communications (IEEE INFOCOM)

作者： Tan, Jethro Pawelczak, Przemyslaw Parks, Aaron Smith, Joshua R. Delft Univ Technol Mekelweg 4 NL-2628 CD Delft Netherlands Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781467399531

computational RFID (CRFID) devices are emerging platforms that can enable perennial computation and sensing by eliminating the need for batteries. Although much research has been devoted to improving upstream (CRFID to RFID reader) communication rates, the opposite direction has so far been neglected, presumably due to the difficulty of guaranteeing fast and error-free transfer amidst frequent power interruptions of CRFID. With growing interest in the market where CRFIDs are forever-embedded in many structures, it is necessary for this void to be filled. therefore, we propose Wisent-a robust downstream communication protocol for CRFIDs that operates on top of the legacy UHF RFID communication protocol: EPC C1G2. the novelty of Wisent is its ability to adaptively change the frame length sent by the reader, based on the length throttling mechanism, to minimize the transfer times at varying channel conditions. We present an implementation of Wisent for the WISP 5 and an off-the-shelf RFID reader. Our experiments show that Wisent allows transfer up to 16 times faster than a baseline, non-adaptive shortest frame case, i.e. single word length, at sub-meter distance. As a case study, we show how Wisent enables wireless CRFID reprogramming, demonstrating the world's first wirelessly reprogrammable (software defined) CRFID.

关键词：

来源：评论

学校读者我要写书评

暂无评论

foundations of Differential Dataflow 18th

Foundations of Differential Dataflow

引用

18th international conference on foundations of software science and computation structures (FoSSaCS)

作者： Abadi, Martin McSherry, Frank Plotkin, Gordon D. Microsoft Res Redmond WA USA Univ Edinburgh Sch Informat LFCS Edinburgh EH8 9YL Midlothian Scotland

ISBN: (纸本)9783662466780;9783662466773

Differential dataflow is a recent approach to incremental computation that relies on a partially ordered set of differences. In the present paper, we aim to develop its foundations. We define a small programming language whose types are abelian groups equipped with linear inverses, and provide both a standard and a differential denotational semantics. the two semantics coincide in that the differential semantics is the differential of the standard one. Mobius inversion, a well-known idea from combinatorics, permits a systematic treatment of various operators and constructs.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

On the sensitivity conjecture for disjunctive normal forms 36

On the sensitivity conjecture for disjunctive normal forms

引用

36th IARCS Annual conference on foundations of software Technology and theoretical Computer science, FSTTCS 2016

作者： Karthik, C.S. Tavenas, Sébastien Weizmann Institute of Science Israel Microsoft Research India

ISBN: (纸本)9783959770279

the sensitivity conjecture of Nisan and Szegedy [CC'94] asks whether for any Boolean function f, the maximum sensitivity s(f), is polynomially related to its block sensitivity bs(f), and hence to other major complexity measures. Despite major advances in the analysis of Boolean functions over the last decade, the problem remains widely open. In this paper, we consider a restriction on the class of Boolean functions through a model of computation (DNF), and refer to the functions adhering to this restriction as admitting the Normalized Block property. We prove that for any function f admitting the Normalized Block property, bs(f) ≤ 4s(f)2. We note that (almost) all the functions mentioned in literature that achieve a quadratic separation between sensitivity and block sensitivity admit the Normalized Block property. Recently, Gopalan et al. [ITCS'16] showed that every Boolean function f is uniquely specified by its values on a Hamming ball of radius at most 2s(f). We extend this result and also construct examples of Boolean functions which provide the matching lower bounds. © Karthik C. S. and Sébastien Tavenas.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Step-Indexed Logical Relations for Probability 18th

Step-Indexed Logical Relations for Probability

引用

18th international conference on foundations of software science and computation structures (FoSSaCS)

作者： Bizjak, Ales Birkedal, Lars Aarhus Univ DK-8000 Aarhus C Denmark

ISBN: (纸本)9783662466780;9783662466773

It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order programming language with impredicative polymorphism and recursive types. We show that the resulting logical relation is sound and complete with respect to the contextual preorder and, moreover, that it is convenient for reasoning about concrete program equivalences. Finally, we extend the language with dynamically allocated first-order references and show how to extend the logical relation to this language. We show that the resulting relation remains useful for reasoning about examples involving both state and probabilistic choice.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Robust Multidimensional Mean-Payoff Games are Undecidable 18th

Robust Multidimensional Mean-Payoff Games are Undecidable

引用

18th international conference on foundations of software science and computation structures (FoSSaCS)

作者： Velner, Yaron Tel Aviv Univ Blavatnik Sch Comp Sci IL-69978 Tel Aviv Israel

ISBN: (纸本)9783662466780;9783662466773

Mean-payoff games play a central role in quantitative synthesis and verification. In a single-dimensional game a weight is assigned to every transition and the objective of the protagonist is to assure a non-negative limit-average weight. In the multidimensional setting, a weight vector is assigned to every transition and the objective of the protagonist is to satisfy a boolean condition over the limit-average weight of each dimension, e.g., LimAvg(xi) < 0 V LimAvg(x2) >= 0 A LimAvg(x3) >= 0. We recently proved that when one of the players is restricted to finite-memory strategies then the decidability of determining the winner is inter-reducible with Hilbert's Tenth problem over rationals (a fundamental long-standing open problem). In this work we consider arbitrary (infinite-memory) strategies for both players and show that the problem is undecidable.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Fragments of ML Decidable by Nested Data Class Memory Automata 18th

Fragments of ML Decidable by Nested Data Class Memory Automa...

引用

18th international conference on foundations of software science and computation structures (FoSSaCS)

作者： Cotton-Barratt, Conrad Hopkins, David Murawski, Andrzej S. Ong, C. -H. Luke Univ Oxford Dept Comp Sci Oxford OX1 2JD England Univ Warwick Dept Comp Sci Coventry CV4 7AL W Midlands England

ISBN: (纸本)9783662466780;9783662466773

the call-by-value language RML may be viewed as a canonical restriction of Standard ML to ground-type references, augmented by a "bad variable" construct in the sense of Reynolds. We consider the fragment of (finitary) RML terms of order at most 1 with free variables of order at most 2, and identify two subfragments of this for which we show observational equivalence to be Sit decidable. the first subfragment, RMLr P211 consists of those terms in which the P-pointers in the game semantic representation are determined by the underlying sequence of moves. the second subfragment consists of terms in which the 0-pointers of moves corresponding to free variables in the game semantic representation are determined by the underlying moves. these results are shown using a reduction to a form of automata over data words in which the data values have a tree-structure, reflecting the tree-structure of the threads in the game semantic plays. In addition we show that observational equivalence is undecidable at every third- or higher-order type, every second-order type which takes at least two firstorder arguments, and every second-order type (of arity greater than one) that has a first-order argument which is not the final argument.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Knowledge = Observation + Memory + computation 18th

Knowledge = Observation + Memory + Computation

引用

18th international conference on foundations of software science and computation structures, FoSSaCS 2015 Held as Part of the European Joint conferences on theory and Practice of software, ETAPS 2015

作者： Genest, Blaise Peled, Doron Schewe, Sven CNRS IRISA Rennes France Bar Ilan University Israel University of Liverpool United Kingdom

ISBN: (纸本)9783662466773

We compare three notions of knowledge in concurrent system: memoryless knowledge, knowledge of perfect recall, and causal knowledge. Memoryless knowledge is based only on the current state of a process, knowledge of perfect recall can take into account the local history of a process, and causal knowledge depends on the causal past of a process, which comprises the information a process can obtain when all processes exchange the information they have when performing joint transitions. We compare these notions in terms of knowledge strength, number of bits required to store this information, and the complexity of checking if a given process has a given knowledge. We show that all three notions of knowledge can be implemented using finite memory. Causal knowledge proves to be strictly more powerful than knowledge with perfect recall, which in turn proves to be strictly more powerful than memoryless knowledge. We show that keeping track of causal knowledge is cheaper than keeping track of knowledge of perfect recall. © 2015, Springer-Verlag Berlin Heidelberg.

关键词： Knowledge management

来源：评论

学校读者我要写书评

暂无评论

Resource Reachability Games on Pushdown Graphs

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Lang, Martin Rhein Westfal TH Aachen Lehrstuhl Informat 7 D-52056 Aachen Germany

ISBN: (纸本)9783642548307;9783642548291

We consider two-player reachability games with additional resource counters on arenas that are induced by the configuration graphs of pushdown systems. For a play, we define the resource cost to be the highest occurring counter value. In this way, we quantify resources and memory that player 0 needs to win. We introduce the bounded winning problem: Is there a uniform bound k such that player 0 can win the game from a set of initial configurations with this bound k? We provide an effective, saturation-based method to solve this problem for regular sets of initial and goal configurations.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

foundations for Decision Problems in Separation Logic with General Inductive Predicates

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Antonopoulos, Timos Gorogiannis, Nikos Haase, Christoph Kanovich, Max Ouaknine, Joel Univ Oxford Dept Comp Sci Oxford England Middlesex Univ London Dept Comp Sci London England CNRS LSV Paris France Ecole Normale Super ENS Cachan Cachan France Queen Mary Univ London Dept Comp Sci London England

ISBN: (纸本)9783642548307;9783642548291

We establish foundational results on the computational complexity of deciding entailment in Separation Logic with general inductive predicates whose underlying base language allows for pure formulas, pointers and existentially quantified variables. We show that entailment is in general undecidable, and ExPTIME-hard in a fragment recently shown to be decidable by Iosif et al. Moreover, entailment in the base language is Pi(P)(2)-complete, the upper bound even holds in the presence of list predicates. We additionally show that entailment in essentially any fragment of Separation Logic allowing for general inductive predicates is intractable even when strong syntactic restrictions are imposed.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes

引用

17th international conference on the foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Fu, Hongfei Rhein Westfal TH Aachen Lehrstuhl Informat 2 Aachen Germany

ISBN: (纸本)9783642548307;9783642548291

In this paper, we consider multi-dimensional maximal costbounded reachability probability over continuous-time Markov decision processes (CTMDPs). Our major contributions are as follows. Firstly, we derive an integral characterization which states that the maximal cost-bounded reachability probability function is the least fixed-point of a system of integral equations. Secondly, we prove that the maximal cost-bounded reachability probability can be attained by a measurable deterministic cost-positional scheduler. thirdly, we provide a numerical approximation algorithm for maximal cost-bounded reachability probability. We present these results under the setting of both early and late schedulers. Besides, we correct a fundamental proof error in the PhD thesis by Martin Neuhaufier on maximal time-bounded reachability probability by completely new proofs for the more general case of multi-dimensional maximal cost-bounded reachability probability.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共18页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：