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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
43 册 图书
14 篇 期刊文献

馆藏范围

211 篇 电子文献
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 篇 作物学

主题

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

机构

4 篇 max planck inst ...
3 篇 max planck inst ...
3 篇 univ leicester d...
3 篇 university of ox...
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 篇 rwth aachen univ...
2 篇 queen mary univ ...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...
2 篇 univ oxford dept...
2 篇 imdea software i...
2 篇 the university o...
2 篇 university of ca...
2 篇 univ paris 07 li...
2 篇 univ london quee...

作者

3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 chistikov dmitry
3 篇 o'hearn p
2 篇 ulidowski irek
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 busi n
2 篇 sagiv mooly
2 篇 naoki kobayashi
2 篇 anna ingólfsdótt...
2 篇 luca aceto
2 篇 haase christoph
2 篇 furio honsell
2 篇 kurz alexander
2 篇 aceto luca
2 篇 pfenning frank
2 篇 boneva i
2 篇 plump detlef
2 篇 mogens nielsen

语言

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

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

共 213 条记录，以下是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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on Flexspline Strength of Harmonic Reducer for Industrial Robot

Research on Flexspline Strength of Harmonic Reducer for Indu...

引用

international conference on Data science and Business Analytics (ICDSBA)

作者： Zelu Zhang Jingjun Gu Jing Tan Dishan Huang Tong Tong Shanghai University Shanghai China Nantong Zhenkang Machinery Co. Ltd Nantong China

the flexspline of a harmonic reducer in an industrial robot has two failure modes. In this paper, using the commercial software Ansys, the problem of flexspline strength is investigated through the boundary condition setting and the static and buckling computation. Meanwhile, the torsion critical load of the flexspline was measured by setting up a torsional test device. the research results show that the flexsplines with different structures have different failure modes, and they can be checked by strength computation.

关键词： Service robots Gears Data science Harmonic analysis Boundary conditions software Finite element analysis

来源：评论

学校读者我要写书评

暂无评论

Exploring the Architectural Impact of Possible Dependencies in Python software 35

Exploring the Architectural Impact of Possible Dependencies ...

引用

35th IEEE/ACM international conference on Automated software Engineering (ASE)

作者： Jin, Wuxia Cai, Yuanfang Kazman, Rick Zhang, Gang Zheng, Qinghua Liu, Ting Xi An Jiao Tong Univ Xian Peoples R China Drexel Univ Philadelphia PA 19104 USA Univ Hawaii Honolulu HI 96822 USA Emergent Design Inc Shanghai Peoples R China Xi An Jiao Tong Univ Key Lab Intelligent Networks & Network Secur MOEK Minist Educ Xian Peoples R China Xi An Jiao Tong Univ Sch Software Engn Xian Peoples R China

ISBN: (纸本)9781450367684

Dependencies among software entities are the basis for many software analytic research and architecture analysis tools. Dynamically typed languages, such as Python, JavaScript and Ruby, tolerate the lack of explicit type references, making certain syntactic dependencies indiscernible in source code. We call these possible dependencies, in contrast with the explicit dependencies that are directly referenced in source code. Type inference techniques have been widely studied and applied, but existing architecture analytic research and tools have not taken possible dependencies into consideration. the fundamental question is, to what extent will these missing possible dependencies impact the architecture analysis? To answer this question, we conducted an empirical study with 105 Python projects, using type inference techniques to manifest possible dependencies. Our study revealed that the architectural impact of possible dependencies is substantial-higher than that of explicit dependencies: (1) file-level possible dependencies account for at least 27.93% of all file-level dependencies, and create different dependency structures than that of explicit dependencies only, with an average difference of 30.71%;(2) adding possible dependencies significantly improves the precision (0.52%similar to 14.18%), recall(31.73%similar to 39.12%), and F1 scores (22.13%similar to 32.09%) of capturing co-change relations;(3) on average, a file involved in possible dependencies influences 28% more files and 42% more dependencies within architectural sub-spaces than a file involved in just explicit dependencies;(4) on average, a file involved in possible dependencies consumes 32% more maintenance effort. Consequently, maintainability scores reported by existing tools make a system written in these dynamic languages appear to be better modularized than it actually is. this evidence strongly suggests that possible dependencies have a more significant impact than explicit dependencies on archi

关键词： dynamic typing possible dependency software architecture empirical study

来源：评论

学校读者我要写书评

暂无评论

Homotopy canonicity for cubical type theory 4

Homotopy canonicity for cubical type theory

引用

4th international conference on Formal structures for computation and Deduction, FSCD 2019

作者： Coquand, thierry Huber, Simon Sattler, Christian Department of Computer Science and Engineering University of Gothenburg Sweden

ISBN: (纸本)9783959771078

Cubical type theory provides a constructive justification of homotopy type theory and satisfies canonicity: every natural number is convertible to a numeral. A crucial ingredient of cubical type theory is a path lifting operation which is explained computationally by induction on the type involving several non-canonical choices. In this paper we show by a sconing argument that if we remove these equations for the path lifting operation from the system, we still retain homotopy canonicity: every natural number is path equal to a numeral. © thierry Coquand, Simon Huber, and Christian Sattler.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

Bicategories in univalent foundations 4

Bicategories in univalent foundations

引用

4th international conference on Formal structures for computation and Deduction, FSCD 2019

作者： Ahrens, Benedikt Frumin, Dan Maggesi, Marco van der Weide, Niels School of Computer Science University of Birmingham United Kingdom Institute for Computation and Information Sciences Radboud University Nijmegen Netherlands Dipartimento di Matematica e Informatica "Dini" Università degli Studi di Firenze Italy

ISBN: (纸本)9783959771078

We develop bicategory theory in univalent foundations. Guided by the notion of univalence for (1-)categories studied by Ahrens, Kapulkin, and Shulman, we define and study univalent bicategories. To construct examples of those, we develop the notion of "displayed bicategories", an analog of displayed 1-categories introduced by Ahrens and Lumsdaine. Displayed bicategories allow us to construct univalent bicategories in a modular fashion. To demonstrate the applicability of this notion, we prove several bicategories are univalent. Among these are the bicategory of univalent categories with families and the bicategory of pseudofunctors between univalent bicategories. Our work is formalized in the UniMath library of univalent mathematics. © Benedikt Ahrens, Dan Frumin, Marco Maggesi, and Niels van der Weide.

关键词： theorem proving

来源：评论

学校读者我要写书评

暂无评论

Some innovations of teaching the course on Data structures and algorithms 15

Some innovations of teaching the course on Data structures a...

引用

IEEE 15th international Scientific conference on Informatics (INFORMATICS)

作者： Steingartner, William Eged, Jan Radakovic, Davorka Novitzka, Valerie Tech Univ Kosice Fac Elect Engn & Informat Kosice Slovakia Univ Novi Sad Fac Sci Novi Sad Serbia

ISBN: (纸本)9781728131795

the teaching of practical foundations of computer science is still a big challenge. the course on Data structures and Algorithms is one of the most important foundational courses that are necessary to be included in the curriculum of future IT experts. the content of this course is quite wide and it differs in many universities. In our teaching process, we identified some interesting problems that could be presented more attractively - using the visualizing software. In this paper, we present a purpose, role, design and methodology of our developed software tool for the convenience of teaching and studying the problem of the longest common subsequence.

关键词： data structures and algorithms formal methods software products software engineering teaching innovation teaching software university didactic

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Modal embeddings and calling paradigms 4

Modal embeddings and calling paradigms

引用

4th international conference on Formal structures for computation and Deduction, FSCD 2019

作者： Espírito Santo, José Pinto, Luís Uustalu, Tarmo Centre of Mathematics University of Minho Portugal School of Computer Science Reykjavik University Iceland Dept. of Software Science Tallinn University of Technology Estonia

We study the computational interpretation of the two standard modal embeddings, usually named after Girard and G46;del, of intuitionistic logic into IS4. As source system we take either the call-by-name (cbn) or th... 详细信息

ISBN: (纸本)9783959771078

We study the computational interpretation of the two standard modal embeddings, usually named after Girard and Gödel, of intuitionistic logic into IS4. As source system we take either the call-by-name (cbn) or the call-by-value (cbv) lambda-calculus with simple types. the target system can be taken to be the, arguably, simplest fragment of IS4, here recast as a very simple lambda-calculus equipped with an indeterminate lax monoidal comonad. A slight refinement of the target and of the embeddings shows that: the target is a calculus indifferent to the calling paradigms cbn/cbv, obeying a new paradigm that we baptize call-by-box (cbb), and enjoying standardization;and that Girard’s (resp. Gödel’s) embbedding is a translation of cbn (resp. cbv) lambda-calculus into this calculus, using a compilation technique we call protecting-by-a-box, enjoying the preservation and reflection properties known for cps translations - but in a stronger form that allows the extraction of standardization for cbn or cbv as consequence of standardization for cbb. the modal target and embeddings achieve thus an unification of call-by-name and call-by-value as call-by-box. © José Espírito Santo, Luís Pinto, and Tarmo Uustalu.

关键词： Standardization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：