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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

154 篇 会议
34 册 图书
17 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

145 篇 工学
- 139 篇 计算机科学与技术...
- 94 篇 软件工程
- 15 篇 电气工程
- 14 篇 信息与通信工程
- 8 篇 控制科学与工程
- 4 篇 化学工程与技术
- 3 篇 土木工程
- 2 篇 力学（可授工学、理...
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 1 篇 电子科学与技术（可...
- 1 篇 建筑学
- 1 篇 测绘科学与技术
- 1 篇 城乡规划学
- 1 篇 生物工程
- 1 篇 网络空间安全
62 篇 理学
- 59 篇 数学
- 5 篇 化学
- 5 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 系统科学
- 1 篇 大气科学
12 篇 管理学
- 12 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学
1 篇 医学
- 1 篇 基础医学(可授医学...

主题

19 篇 software enginee...
15 篇 theory of comput...
13 篇 logics and meani...
11 篇 mathematical log...
10 篇 programming lang...
10 篇 artificial intel...
10 篇 computation by a...
9 篇 software enginee...
9 篇 algorithm analys...
9 篇 computer softwar...
7 篇 system analysis
6 篇 semantics
6 篇 data structures
5 篇 model checking
5 篇 computer system ...
5 篇 discrete mathema...
5 篇 programming tech...
5 篇 mathematics of c...
4 篇 specifications
4 篇 data structures ...

机构

4 篇 max planck inst ...
4 篇 chinese acad sci...
3 篇 max planck inst ...
3 篇 nanjing univ sta...
3 篇 university of ox...
3 篇 tech univ dortmu...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 univ wisconsin d...
2 篇 xidian univ inst...
2 篇 univ london impe...
2 篇 univ bologna dip...
2 篇 xidian univ isn ...
2 篇 chinese acad sci...
2 篇 univ leicester d...
2 篇 cwi dept softwar...
2 篇 microsoft res as...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...
2 篇 chinese acad sci...

作者

3 篇 zavattaro g
3 篇 doberkat ernst-e...
3 篇 chistikov dmitry
2 篇 ulidowski irek
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 busi n
2 篇 zhan naijun
2 篇 yoshida nobuko
2 篇 sagiv mooly
2 篇 naoki kobayashi
2 篇 cai jin-yi
2 篇 haase christoph
2 篇 furio honsell
2 篇 kurz alexander
2 篇 yang xiaoxiao
2 篇 aceto luca
2 篇 berard beatrice
2 篇 uustalu tarmo
2 篇 xia mingji

语言

198 篇 英文
4 篇 中文
3 篇 其他

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

共 205 条记录，以下是31-40 订阅

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

详细简洁

排序：

19th international conference on foundations of software science and computation structures, FOSSACS 2016 held as part of the European Joint conferences on theory and Practice of software, ETAPS 2016

19th International Conference on Foundations of Software Sci...

引用

19th international conference on foundations of software science and computation structures, FOSSACS 2016 and Held as Part of the European Joint conferences on theory and Practice of software, ETAPS 2016

ISBN: (纸本)9783662496299

the proceedings contain 31 papers. the special focus in this conference is on Types, Recursion and Fixed-Points. the topics include: Comprehensive parametric polymorphism;guarded dependent type theory with coinductive types;dependent types and fibred computational effects;game semantics for bounded polymorphism;join inverse categories as models of reversible recursion;a coalgebraic view of bar recursion and bar induction;a new foundation for finitary corecursion;fixed-point elimination in the intuitionistic propositional calculus;contextual approximation and higher-order procedures;a theory of slicing for probabilistic control flow graphs;verification of parameterized communicating automata via split-width;robust equilibria in mean-payoff games;quantifier alternation for infinite words;synchronizing automata over nested words;on freeze LTL with ordered attributes;regular transformations of data words through origin information;trace refinement in labelled markov decision processes;qualitative analysis of VASS-induced MDPs;metric temporal logic with counting;distributed synthesis in continuous time;focused and synthetic nested sequents;reasoning about call-by-need by means of types;coverability trees for petri nets with unordered data;shortest paths in one-counter systems;the invariance problem for matrix semigroups;order-sorted rewriting and congruence closure;towards a formal theory of graded monads and profinite monads, profinite equations, and Reiterman’s theorem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parameterized Synthesis for Fragments of First-Order Logic over Data Words 1

引用

23rd international conference on foundations of software science and computation structures (FoSSaCS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Berard, Beatrice Bollig, Benedikt Lehaut, Mathieu Sznajder, Nathalie Sorbonne Univ LIP6 CNRS F-75005 Paris France Univ Paris Saclay LSV CNRS Cachan France Univ Paris Saclay ENS Paris Saclay Cachan France

ISBN: (数字)9783030452315

ISBN: (纸本)9783030452315;9783030452308

We study the synthesis problem for systems with a parameterized number of processes. As in the classical case due to Church, the system selects actions depending on the program run so far, with the aim of fulfilling a given specification. the difficulty is that, at the same time, the environment executes actions that the system cannot control. In contrast to the case of fixed, finite alphabets, here we consider the case of parameterized alphabets. An alphabet reflects the number of processes, which is static but unknown. the synthesis problem then asks whether there is a finite number of processes for which the system can satisfy the specification. this variant is already undecidable for very limited logics. therefore, we consider a first-order logic without the order on word positions. We show that even in this restricted case synthesis is undecidable if both the system and the environment have access to all processes. On the other hand, we prove that the problem is decidable if the environment only has access to a bounded number of processes. In that case, there is even a cutoff meaning that it is enough to examine a bounded number of process architectures to solve the synthesis problem.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Efficient Construction of Functional Representations for Quantum Algorithms 13th

Efficient Construction of Functional Representations for Qua...

引用

13th international conference on Reversible computation (RC)

作者： Burgholzer, Lukas Raymond, Rudy Sengupta, Indranil Wille, Robert Institute for Integrated Circuits Johannes Kepler University Linz Linz Austria IBM Quantum IBM Research Tokyo Japan Indian Institute of Technology Kharagpur Kharagpur India Software Competence Center Hagenberg GmbH (SCCH) Hagenberg 4232 Austria

ISBN: (纸本)9783030798369;9783030798376

Due to the significant progress made in the implementation of quantum hardware, efficient methods and tools to design corresponding algorithms become increasingly important. Many of these tools rely on functional representations of certain building blocks or even entire quantum algorithms which, however, inherently exhibit an exponential complexity. Although several alternative representations have been proposed to cope with this complexity, the construction of those representations remains a bottleneck. In this work, we propose solutions for efficiently constructing representations of quantum functionality based on the idea of conducting as many operations as possible on as small as possible intermediate representations-using Decision Diagrams as a representative functional description. Experimental evaluations show that applying these solutions allows to construct the desired representations several factors faster than with state-of-the-art methods. Moreover, if repeating structures (which frequently occur in quantum algorithms) are explicitly exploited, exponential improvements are possible-allowing to construct the functionality of certain algorithms within seconds, whereas the state of the art fails to construct it in an entire day.

关键词： Quantum efficiency

来源：评论

学校读者我要写书评

暂无评论

Structure Preserved Graph Reordering for Fast Graph Processing without the Pain 22

Structure Preserved Graph Reordering for Fast Graph Processi...

引用

22nd IEEE international conference on High Performance Computing and Communications, 18th IEEE international conference on Smart City and 6th IEEE international conference on Data science and Systems, HPCC-SmartCity-DSS 2020

作者： Huang, Baofu Liu, Zhidan Wu, Kaishun Shenzhen University College of Computer Science and Software Engineering China

ISBN: (纸本)9781728176499

By optimizing the data layout ahead-of-Time, graph reordering can effectively improve the memory access locality in graph processing. the reordered graphs derived by sophisticated graph reordering approaches can greatly speedup the executions of most graph algorithms, while they incur huge computation overheads. Although lightweight approaches indeed reduce the reordering costs, they cannot achieve the best speedup performances. this is because they merely operate vertices of high-degrees and inadvertently destroy the community structures hidden in the graph. In this paper, we thus propose Sorder to balance the speedup performance and the reordering overhead. Sorder achieves better locality by preserving structural properties of graphs. Specifically, it mainly exploits neighborhood relations to renumber vertices and preferentially reorders vertices of high-degree ahead of the other vertices. We further enhance the design with the hypernode concept, which gathers neighboring vertices of low-degree to form a virtual vertex. therefore, Sorder can consecutively rearrange more neighboring vertices, such that protecting the community structures. Extensive experiments with 5 representative graph algorithms and 7 real-world graphs demonstrate that Sorder can achieve comparable speedup performance as Gorder, the state-of-the-Art approach, while significantly reducing the reordering overhead. © 2020 IEEE.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

IEEE ICCI*CC Series in Year 20: Latest Advances in Cognitive Computing (Plenary Panel Report-II) 20

IEEE ICCI*CC Series in Year 20: Latest Advances in Cognitive...

引用

20th IEEE international conference on Cognitive Informatics and Cognitive Computing, ICCI*CC 2021

作者： Kinsner, Witold Zhu, Haibin Baciu, George Luo, Guiming Rubio, Fernando Sui, Jie Huang, Runhe Hiraishi, Hironori Peng, Jun Chen, Liang Univ. of Manitoba FI2CICC Dept of ECE Winnipeg Canada Nipissing University FI2CICC ON Canada Hong Kong Polytechnic University FI2CICC Dept. of Computing Hong Kong Tsinghua University FI2CICC Software Institute Beijing China Complutense Univ. of Madrid FI2CICC Dept. of Computer Systems and Computation Spain Aberdeen University FI2CICC Aberdeen United Kingdom Hosei University FI2CICC Faculty of Computer and Information Sciences Japan Ashikaga University Faculty of Engineering Tochigi326-8558 Japan Chongqing Univ. of Science and Technology FI2CICC School of AI Chongqing China Univ. of Northern British Columbia Dept. of Computer Science BC Canada

ISBN: (纸本)9781665421195

Cognitive Computing (CC) is a contemporary field of fundamental intelligence theories and general AI technologies triggered by the transdisciplinary development in intelligence, computer, brain, knowledge, cognitive, robotic, and cybernetic sciences for engineering implementations. this paper presents a summary of the plenary panel (Part II) on the theoretical foundations of CI/CC and recent breakthroughs in AI engineering reported in the 20th IEEE international ICCI*CC conference (ICCI*CC'21). the latest advances in CI and CC towards general AI are presented by twenty-Two distinguished panelists. Strategic AI engineering applications in CI, CC, and cognitive systems are elaborated for abstract intelligence, cognitive robots, autonomous systems, intelligent vehicles, and safety-And-mission-critical systems. © 2021 IEEE.

关键词： Cognitive systems

来源：评论

学校读者我要写书评

暂无评论

Strongly normalizing higher-order relational queries 5

Strongly normalizing higher-order relational queries

引用

5th international conference on Formal structures for computation and Deduction, FSCD 2020

作者： Ricciotti, Wilmer Cheney, James Laboratory for Foundations of Computer Science University of Edinburgh United Kingdom

ISBN: (纸本)9783959771559

Language-integrated query is a powerful programming construct allowing database queries and ordinary program code to interoperate seamlessly and safely. Language-integrated query techniques rely on classical results about monadic comprehension calculi, including the conservativity theorem for nested relational calculus. Conservativity implies that query expressions can freely use nesting and unnesting, yet as long as the query result type is a flat relation, these capabilities do not lead to an increase in expressiveness over flat relational queries. Wong showed how such queries can be translated to SQL via a constructive rewriting algorithm, and Cooper and others advocated higher-order nested relational calculi as a basis for language-integrated queries in functional languages such as Links and F#. However there is no published proof of the central strong normalization property for higher-order nested relational queries: a previous proof attempt does not deal correctly with rewrite rules that duplicate subterms. this paper fills the gap in the literature, explaining the difficulty with a previous proof attempt, and showing how to extend the >>-lifting approach of Lindley and Stark to accommodate duplicating rewrites. We also sketch how to extend the proof to a recently-introduced calculus for heterogeneous queries mixing set and multiset semantics. © Wilmer Ricciotti and James Cheney;licensed under Creative Commons License CC-BY 5th international conference on Formal structures for computation and Deduction (FSCD 2020).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

foundations of Coin Mixing Services 22

Foundations of Coin Mixing Services

引用

28th ACM SIGSAC conference on Computer and Communications Security, CCS 2022

作者： Glaeser, Noemi Maffei, Matteo Malavolta, Giulio Moreno-Sanchez, Pedro Tairi, Erkan thyagarajan, Sri Aravinda Krishnan University of Maryland College ParkMD United States Max Planck Insitute for Security and Privacy Bochum Germany Tu Wien Christian Doppler Laboratory Blockchain Technologies for the Internet of Things Vienna Austria Imdea Software Institute Madrid Spain Carnegie Mellon University PittsburghPA United States

ISBN: (纸本)9781450394505

Coin mixing services allow users to mix their cryptocurrency coins and thus enable unlinkable payments in a way that prevents tracking of honest users' coins by both the service provider and the users themselves. the easy bootstrapping of new users and backwards compatibility with cryptocurrencies (such as Bitcoin) with limited support for scripts are attractive features of this architecture, which has recently gained considerable attention in both academia and industry. A recent work of Tairi et al. [IEEE S&P 2021] formalizes the notion of a coin mixing service and proposes A2L, a new cryptographic protocol that simultaneously achieves high efficiency and interoperability. In this work, we identify a gap in their formal model and substantiate the issue by showing two concrete counterexamples: we show how to construct two encryption schemes that satisfy their definitions but lead to a completely insecure system. To amend this situation, we investigate secure constructions of coin mixing services. First, we develop the notion of blind conditional signatures (BCS), which acts as the cryptographic core for coin mixing services. We propose game-based security definitions for BCS and propose A2L+, a modified version of the protocol by Tairi et al. that satisfies our security definitions. Our analysis is in an idealized model (akin to the algebraic group model) and assumes the hardness of the one-more discrete logarithm problem. Finally, we propose A2L-UC, another construction of BCS that achieves the stronger notion of UC-security (in the standard model), albeit with a significant increase in computation cost. this suggests that constructing a coin mixing service protocol secure under composition requires more complex cryptographic machinery than initially thought. © 2022 ACM.

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

Structure Preserved Graph Reordering for Fast Graph Processing Without the Pain

Structure Preserved Graph Reordering for Fast Graph Processi...

引用

IEEE international conference on High Performance Computing and Communications (HPCC)

作者： Baofu Huang Zhidan Liu Kaishun Wu College of Computer Science and Software Engineering Shenzhen University China

ISBN: (纸本)9781728176505

By optimizing the data layout ahead-of-time, graph reordering can effectively improve the memory access locality in graph processing. the reordered graphs derived by sophisticated graph reordering approaches can greatly speedup the executions of most graph algorithms, while they incur huge computation overheads. Although lightweight approaches indeed reduce the reordering costs, they cannot achieve the best speedup performances. this is because they merely operate vertices of high-degrees and inadvertently destroy the community structures hidden in the graph. In this paper, we thus propose Sorder to balance the speedup performance and the reordering overhead. Sorder achieves better locality by preserving structural properties of graphs. Specifically, it mainly exploits neighborhood relations to renumber vertices and preferentially reorders vertices of high-degree ahead of the other vertices. We further enhance the design with the hypernode concept, which gathers neighboring vertices of low-degree to form a virtual vertex. therefore, Sorder can consecutively rearrange more neighboring vertices, such that protecting the community structures. Extensive experiments with 5 representative graph algorithms and 7 real-world graphs demonstrate that Sorder can achieve comparable speedup performance as Gorder, the state-of-the-art approach, while significantly reducing the reordering overhead.

关键词： Pain High performance computing conferences Layout

来源：评论

学校读者我要写书评

暂无评论

Causality in Linear Logic Full Completeness and Injectivity (Unit-Free Multiplicative-Additive Fragment) 22nd

Causality in Linear Logic Full Completeness and Injectivity ...

引用

22nd international conference on foundations of software science and computation structures (FoSSaCS) Held as Part of the European Joint conferences on theory and Practice of software (EATPS)

作者： Castellan, Simon Yoshida, Nobuko Imperial Coll London London England

ISBN: (纸本)9783030171278;9783030171261

Commuting conversions of Linear Logic induce a notion of dependency between rules inside a proof derivation: a rule depends on a previous rule when they cannot be permuted using the conversions. We propose a new interpretation of proofs of Linear Logic as causal invariants which captures exactly this dependency. We represent causal invariants using game semantics based on general event structures, carving out, inside the model of [6], a submodel of causal invariants. this submodel supports an interpretation of unit-free Multiplicative Additive Linear Logic with MIX (MALL(-)) which is (1) fully complete: every element of the model is the denotation of a proof and (2) injective: equality in the model characterises exactly commuting conversions of MALL(-). this improves over the standard fully complete game semantics model of MALL(-).

关键词： Event structures Linear Logic Proof nets Game semantics

来源：评论

学校读者我要写书评

暂无评论

foundations of software science and computation structures: 18th international conference, FOSSACS 2015 held as part of the European joint conferences on theory and practice of software, ETAPS 2015 London, UK, april 11–18, 2015 proceedings 18th

Foundations of software science and computation structures: ...

引用

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

作者： Pitts, Andrew University of Cambridge Cambridge United Kingdom

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：