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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

179 篇 会议
36 册 图书
13 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

166 篇 工学
- 155 篇 计算机科学与技术...
- 118 篇 软件工程
- 16 篇 电气工程
- 16 篇 信息与通信工程
- 15 篇 控制科学与工程
- 5 篇 土木工程
- 3 篇 建筑学
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
75 篇 理学
- 70 篇 数学
- 8 篇 统计学（可授理学、...
- 6 篇 物理学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 化学
- 1 篇 大气科学
13 篇 管理学
- 10 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
2 篇 法学
- 2 篇 社会学
2 篇 文学
- 2 篇 新闻传播学
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学
1 篇 农学

主题

17 篇 theory of comput...
14 篇 software enginee...
13 篇 mathematical log...
13 篇 semantics
13 篇 artificial intel...
11 篇 computation by a...
10 篇 logics and meani...
10 篇 algorithm analys...
9 篇 programming lang...
9 篇 computer softwar...
8 篇 software enginee...
8 篇 model checking
8 篇 data structures
7 篇 system analysis
6 篇 data structures ...
6 篇 mathematics of c...
5 篇 computer system ...
5 篇 programming tech...
5 篇 differentiation ...
4 篇 computability an...

机构

8 篇 univ leicester d...
6 篇 univ london impe...
4 篇 max planck inst ...
4 篇 rhein westfal th...
3 篇 imperial coll lo...
3 篇 max planck inst ...
3 篇 university of tw...
3 篇 university of ox...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 rhein westfal th...
2 篇 univ bologna dip...
2 篇 fakultät für inf...
2 篇 cnrs
2 篇 cwi dept softwar...
2 篇 univ warwick dep...
2 篇 univ oxford dept...
2 篇 univ london impe...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...

作者

4 篇 pattinson dirk
3 篇 ulidowski irek
3 篇 edalat abbas
3 篇 kurz alexander
3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 heckel reiko
3 篇 phillips iain
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 hu liqiang
2 篇 busi n
2 篇 carlos martín-vi...
2 篇 yoshida nobuko
2 篇 schroeder lutz
2 篇 sagiv mooly
2 篇 noll thomas
2 篇 naoki kobayashi
2 篇 haase christoph
2 篇 katoen joost-pie...

语言

219 篇 英文
5 篇 其他
5 篇 中文

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

共 228 条记录，以下是21-30 订阅

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

详细简洁

排序：

On the Expressiveness of Buchi Arithmetic 1

引用

24th 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)

作者： Haase, Christoph Rozycki, Jakub Univ Oxford Dept Comp Sci Oxford England Univ Warsaw Inst Math Warsaw Poland

ISBN: (数字)9783030719951

ISBN: (纸本)9783030719951;9783030719944

We show that the existential fragment of Buchi arithmetic is strictly less expressive than full Buchi arithmetic of any base, and moreover establish that its Sigma(2)-fragment is already expressively complete. Furthermore, we show that regular languages of polynomial growth are definable in the existential fragment of Buchi arithmetic.

关键词： logical theories logical definability quantifier elimination automatic structures regular languages

来源：评论

学校读者我要写书评

暂无评论

DyNetKAT: An Algebra of Dynamic Networks 1

引用

25th international conference on Fundamental Approaches to software Engineering (FASE) Held as Part of the Annual European Joint conferences on theory and Practice of software (ETAPS)

作者： Caltais, Georgiana Hojjat, Hossein Mousavi, Mohammad Reza Tunc, Hunkar Can Univ Konstanz Constance Germany Univ Twente Enschede Netherlands Khatam Univ TeIAS Tehran Iran Univ Tehran Tehran Iran Kings Coll London London England Aarhus Univ Aarhus Denmark

ISBN: (数字)9783030992538

ISBN: (纸本)9783030992538;9783030992521

We introduce a formal language for specifying dynamic updates for software Defined Networks. Our language builds upon Network Kleene Algebra with Tests (NetKAT) and adds constructs for synchronisations and multi-packet behaviour to capture the interaction between the control- and data-plane in dynamic updates. We provide a sound and ground-complete axiomatisation of our language. We exploit the equational theory and provide an efficient method for reasoning about safety properties. We implement our equational theory in DyNetiKAT - a tool prototype, based on the Maude Rewriting Logic and the NetKAT tool, and apply it to a case study. We show that we can analyse the case study for networks with hundreds of switches using our tool prototype.

关键词： software Defined Networks Dynamic Updates Dynamic Network Reconfiguration NetKAT Process Algebra Equational Reasoning

来源：评论

学校读者我要写书评

暂无评论

Cutting a Proof into Bite-Sized Chunks Incrementally proving termination in higher-order term rewriting 7

Cutting a Proof into Bite-Sized Chunks Incrementally proving...

引用

7th international conference on Formal structures for computation and Deduction, FSCD 2022

作者： Kop, Cynthia Department of Software Science Radboud University Nijmegen Netherlands

ISBN: (纸本)9783959772334

this paper discusses a number of methods to prove termination of higher-order term rewriting systems, with a particular focus on large systems. In first-order term rewriting, the dependency pair framework can be used to split up a large termination problem into multiple (much) smaller components that can be solved individually. this is important because a large problem may take exponentially longer to solve in one go than solving each of its components. Unfortunately, while there are higher-order versions of several of these methods, they often fail to simplify a problem enough. Here, we will explore some of these techniques and their limitations, and discuss what else can be done to incrementally build a termination proof for higher-order systems. © Cynthia Kop

关键词： Algebra Interpretations Dependency Pairs Higher-order term rewriting Modularity Termination

来源：评论

学校读者我要写书评

暂无评论

Tool Support for Functional Graph Rewriting with Persistent Data structures - GrapeVine 15th

Tool Support for Functional Graph Rewriting with Persistent ...

引用

15th international conference on Graph Transformation (ICGT) Held as Part of conference on software Technologies - Applications and foundations (STAF)

作者： Weber, Jens H. Univ Victoria Victoria BC Canada

ISBN: (纸本)9783031098437;9783031098420

Existing graph transformation (GT) tools treat graphs as ephemeral data structures, i.e., the successful application of a GT rule to a graph G rewrites that graph to produce a modified graph G'. the original graph G is lost during that update. In contrast to ephemeral data structures, persistent data structures preserve access to all previous versions when data is modified and fully persistent data structures even allow all previous versions to be modified. In earlier work, we introduced the Graph Rewriting and Persistence Engine Grape as a tool for specifying and executing transformations on large-scale graphs and integrated it with a computational notebook platform (GrapePress). While the term "persistence" has been in the tool's acronym from the start, it was chosen to indicate that graphs were maintained in a database with transactional support. Until now, Grape (and GrapePress) treated graphs as ephemeral data structures, i.e., previous graph versions were not retained upon modification. this paper presents a major revision of the tool (called GrapeVine) to support functional graph rewriting based on a fully persistent data structure.

关键词： Graph transformations Grape GrapeVine persistent data structures tools graph processes computational notebook tools

来源：评论

学校读者我要写书评

暂无评论

Modelling of diffraction of X-rays in perovskite superlattices 7

Modelling of diffraction of X-rays in perovskite superlattic...

引用

7th international conference of computational Methods in Engineering science, CMES 2022

作者： Kokosza, L. Mitura, Z. Department of Applied Computer Science and Modelling Faculty of Metals Engineering and Industrial Computer Science AGH University of Science and Technology al. Mickiewicza 30 Kraków30-059 Poland

Nowadays, different perovskite structures are widely investigated because they can be potentially used in many branches of industry. If two materials are deposited alternately on a substrate, then a superlattice having some unique properties can be formed. However, X-ray intensity distributions for perovskite superlattices, especially for very thin films, are difficult to be computationally determined, because many different parameters need to be considered to reproduce a superstructure of a sample. the main purpose of this work is to demonstrate how basic intensity distributions can be generated for perovskites, XRD technique and how to improve results using specific numerical methods. the computer application with a user-friendly graphical interface has been developed employing Unity software (with 3D graphics tools) and Oracle Database (through Oracle Cloud Infrastructure). the calculations are based on the kinematical theory of diffraction. the values of some important parameters and the results are stored in the assigned database. It is assumed that epitaxial superlattices can be prepared on substrates using molecular beam epitaxy or pulsed laser deposition methods. the desktop application allows for designing samples of different thicknesses and combinations of monolayers. the results are more realistic if Monte Carlo simulations are done although longer computation time is required. the software developed should be helpful to compare in detail virtual model results with experimental data. © 2022 Institute of Physics Publishing. All rights reserved.

关键词： Perovskite

来源：评论

学校读者我要写书评

暂无评论

Prediction of Optimal Locations for 5G Base Stations in Urban Environments Using Neural Networks and Satellite Image Analysis 10th

Prediction of Optimal Locations for 5G Base Stations in Urba...

引用

10th international Work-conference on the Interplay Between Natural and Artificial computation (IWINAC)

作者： Garcia-Aguilar, Ivan Galeano-Brajones, Jesus Luna-Valero, Francisco Carmona-Murillo, Javier David Fernandez-Rodriguez, Jose Luque-Baena, Rafael M. Univ Malaga ITIS Software C Arquitecto Francisco Pelialosa 18 Malaga 29010 Spain Biomed Res Inst Malaga IBIMA C Doctor Miguel Diaz Recio 28 Malaga 29010 Spain Univ Extremadura Dept Comp & Telemat Engn C Sta Teresa Jornet 38 Merida 06800 Spain

ISBN: (纸本)9783031611360;9783031611377

Deploying 5G networks in urban areas is crucial for meeting the increasing demand for high-speed, low-latency wireless communications. However, the complex topography and diverse building structures in urban environments have challenges in identifying suitable locations for base stations. this research explores leveraging deep learning neural networks to analyze satellite imagery, creating a predictive tool for identifying potential rooftop locations. Integrating these predictions into a user-friendly desktop application simplifies the site selection process, reducing the need for costly and labor-intensive site visits in 5G network deployment. this approach democratizes the deployment process, making it accessible to a broader audience. the combination of advanced technology and satellite imagery offers a promising solution to efficiently deploy 5G base stations in urban landscapes, contributing to the widespread adoption of this technology in densely populated areas and advancing 5G connectivity globally.

关键词： Convolutional Neural Network (CNN) Deep Learning (DL) 5G Deployment

来源：评论

学校读者我要写书评

暂无评论

Nominal Equational Problems 1

引用

24th 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)

作者： Ayala-Rincon, Mauricio Fernandez, Maribel Nantes-Sobrinho, Daniele Vale, Deivid Univ Brasilia Dept Comp Sci Brasilia DF Brazil Univ Brasilia Dept Math Brasilia DF Brazil Kings Coll London Dept Informat London England Radboud Univ Nijmegen Dept Software Sci Nijmegen Netherlands

ISBN: (数字)9783030719951

ISBN: (纸本)9783030719951;9783030719944

We define nominal equational problems of the form E (W) over bar for all(Y) over bar : P, where P consists of conjunctions and disjunctions of equations s approximate to(alpha) t, freshness constraints a#t and their negations: s not approximate to(alpha) t and a # t, where a is an atom and s, t nominal terms. We give a general definition of solution and a set of simplification rules to compute solutions in the nominal ground term algebra. For the latter, we define notions of solved form from which solutions can be easily extracted and show that the simplification rules are sound, preserving, and complete. With a particular strategy for rule application, the simplification process terminates and thus specifies an algorithm to solve nominal equational problems. these results generalise previous results obtained by Comon and Lescanne for first-order languages to languages with binding operators. In particular, we show that the problem of deciding the validity of a first-order equational formula in a language with binding operators (i.e., validity modulo alpha-equality) is decidable.

关键词： Nominal syntax Unification Disunification

来源：评论

学校读者我要写书评

暂无评论

foundations of software science and computation structures: 19th international conference, FOSSACS 2016 held as part of the European joint conferences on theory and practice of software, ETAPS 2016 Eindhoven, the Netherlands, April 2-8, 2016 proceedings 19th

Foundations of software science and computation structures: ...

引用

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

作者： Jacobs, Bart Löding, Christof Radboud University Nijmegen Nijmegen Netherlands RWTH Aachen University Aachen Germany

来源：评论

学校读者我要写书评

暂无评论

Data Management Model to Program Irregular Compute Kernels on FPGA: Application to Heterogeneous Distributed System 27th

Data Management Model to Program Irregular Compute Kernels o...

引用

27th international European conference on Parallel and Distributed Computing (Euro-Par)

作者： Lenormand, Erwan Goubier, thierry Cudennec, Loic Charles, Henri-Pierre Univ Paris Saclay LIST CEA F-91191 Gif Sur Yvette France DGA Maitrise Informat BP 7 F-35998 Rennes France Univ Grenoble Alpes LIST CEA F-38000 Grenoble France

ISBN: (纸本)9783031061561;9783031061554

this paper presents a data management model targeting heterogeneous distributed systems integrating reconfigurable accelerators. the purpose of this model is to reduce the complexity of developing applications with multidimensional sparse data structures. It relies on a shared memory paradigm, which is convenient for parallel programming of irregular applications. the distributed data, sliced in chunks, are managed by a software-Distributed Shared Memory (S-DSM). the integration of reconfigurable accelerators in this S-DSM, by breaking the master-slave model, allows devices to initiate access to chunks in order to accept data-dependent accesses. We use chunk partitioning of multidimensional sparse data structures, such as sparse matrices and unstructured meshes, to access them as a continuous data stream. this model enables to regularize memory accesses of irregular applications, to avoid the transfer of unnecessary data by providing fine-grained data access, and to efficiently hide data access latencies by implicitly overlaying the transferred data flow with the processed data flow. We have used two case studies to validate the proposed data management model: General Sparse Matrix-Matrix Multiplication (SpGEMM) and Shallow Water Equations (SWE) over an unstructured mesh. the results obtained show that the proposed model efficiently hides the data access latencies by reaching computation speeds close to those of an ideal case (i.e. without latency).

关键词： Distributed shared memory Field programmable gate array Irregular application

来源：评论

学校读者我要写书评

暂无评论

Ambiguity, Weakness, and Regularity in Probabilistic Buchi Automata 23rd

Ambiguity, Weakness, and Regularity in Probabilistic Buchi A...

引用

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)

作者： Loeding, Christof Pirogov, Anton Rhein Westfal TH Aachen Templergraben 55 D-52062 Aachen Germany

ISBN: (纸本)9783030452315;9783030452308

Probabilistic Buchi automata are a natural generalization of PFA to infinite words, but have been studied in-depth only rather recently and many interesting questions are still open. PBA are known to accept, in general, a class of languages that goes beyond the regular languages. In this work we extend the known classes of restricted PBA which are still regular, strongly relying on notions concerning ambiguity in classical omega-automata. Furthermore, we investigate the expressivity of the not yet considered but natural class of weak PBA, and we also show that the regularity problem for weak PBA is undecidable.

关键词： probabilistic Buchi automata ambiguity weak

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：