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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是11-20 订阅

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

详细简洁

排序：

20th international conference on foundations of software science and computation structures, FOSSACS 2017

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

引用

20th international conference on foundations of software science and computation structures, FOSSACS 2017

ISBN: (纸本)9783662544570

the proceedings contain 32 papers. the special focus in this conference is on foundations of software science and computation structures. the topics include: Coherence spaces and uniform continuity;the free exponential modality of probabilistic coherence spaces;algebra, coalgebra, and minimization in polynomial;equational theories of abnormal termination based on kleene algebra;companions, codensity and causality;nominal automata with name binding;on the existence of weak subgame perfect equilibria;optimal reachability in divergent weighted timed games;logics of repeating values on data trees and branching counter systems;degree of sequentiality of weighted automata;emptiness under isolation and the value problem for hierarchical probabilistic automata;partial derivatives for context-free languages: from l-regular expressions to pushdown automata;dynamic complexity of the dyck reachability;on the relationship between bisimulation and trace equivalence in an approximate probabilistic context;computing continuous-time markov chains as transformers of unbounded observables;local model checking in a logic for true concurrency;on the undecidability of asynchronous session subtyping;automated constructivization of proofs;a light modality for recursion;unifying guarded and unguarded iteration;local model checking in a logic for true concurrency;on the undecidability of asynchronous session subtyping;unifying guarded and unguarded iteration and on the semantics of intensionality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Unboundedness Problems for Machines with Reversal-Bounded Counters 1

引用

26th international conference on foundations of software science and computational structures (FOSSACS)

作者： Baumann, Pascal D'Alessandro, Flavio Ganardi, Moses Ibarra, Oscar McQuillan, Ian Schuetze, Lia Zetzsche, Georg Max Planck Inst Software Syst MPI SWS Kaiserslautern Germany Max Planck Inst Software Syst MPI SWS Saarbrucken Germany Sapienza Univ Rome Dept Math G Castelnuovo Rome Italy Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA Univ Saskatchewan Dept Comp Sci Saskatoon SK Canada

ISBN: (数字)9783031308291

ISBN: (纸本)9783031308284;9783031308291

We consider a general class of decision problems concerning formal languages, called "(one-dimensional) unboundedness predicates", for automata that feature reversal-bounded counters (RBCA). We show that each problem in this class reduces-non-deterministically in polynomial time-to the same problem for just finite automata. We also show an analogous reduction for automata that have access to both a pushdown stack and reversal-bounded counters (PRBCA). this allows us to answer several open questions: For example, we show that it is coNP-complete to decide whether a given (P)RBCA language L is bounded, meaning whether there exist words w(1),..., w(n) with L subset of w*(1) center dot center dot center dot w*(n). For PRBCA, even decidability was open. Our methods also show that there is no language of a (P)RBCA of intermediate growth. this means, the number of words of each length grows either polynomially or exponentially. Part of our proof is likely of independent interest: We show that one can translate an RBCA into a machine with Z-counters in logarithmic space, while preserving the accepted language.

关键词： Formal languages Decidability Complexity Counter automata Reversal-bounded Pushdown Boundedness Unboundedness

来源：评论

学校读者我要写书评

暂无评论

Structural Liveness of Conservative Petri Nets 28th

Structural Liveness of Conservative Petri Nets

引用

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

作者： Jančar, Petr Leroux, Jérôme Valůšek, Jiří Department of Computer Science Faculty of Science Palacký University Olomouc Czech Republic LaBRI CNRS University of Bordeaux Bordeaux France

ISBN: (纸本)9783031908965

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jančar and Purser, 2019] holds even for a simple subclass of conservative nets. As the main result we then show that for structurally live conservative nets the values of the least live markings are at most double exponential in the size of the nets, which entails the EXPSPACE-completeness of structural liveness for conservative Petri nets;the complexity of the general case remains unclear. As a proof ingredient with a potential of wider applicability, we present an extension of the known results bounding the smallest integer solutions of boolean combinations of linear (in)equations and divisibility constraints. © the Author(s) 2025.

关键词： conservative net Petri net structural liveness

来源：评论

学校读者我要写书评

暂无评论

Temporal Hyperproperties for Population Protocols 28th

Temporal Hyperproperties for Population Protocols

引用

作者： Waldburger, Nicolas Weil-Kennedy, Chana Ganty, Pierre Sánchez, César Université de Rennes IRISA INRIA Rennes France IMDEA Software Institute Pozuelo de Alarcón Madrid Spain

ISBN: (纸本)9783031908965

Hyperproperties are properties over sets of traces (or runs) of a system, as opposed to properties of just one trace. they were introduced in 2010 and have been much studied since, in particular via an extension of the temporal logic LTL called HyperLTL. Most verification efforts for HyperLTL are restricted to finite-state systems, usually defined as Kripke structures. In this paper we study hyperproperties for an important class of infinite-state systems. We consider population protocols, a popular distributed computing model in which arbitrarily many identical finite-state agents interact in pairs. Population protocols are a good candidate for studying hyperproperties because the main decidable verification problem, well-specification, is a hyperproperty. We first show that even for simple (monadic) formulas, HyperLTL verification for population protocols is undecidable. We then turn our attention to immediate observation population protocols, a simpler and well-studied subclass of population protocols. We show that verification of monadic HyperLTL formulas without the next operator is decidable in 2-EXPSPACE, but that all extensions make the problem undecidable. © the Author(s) 2025.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

A GPU computation-Based Ray Tracing Engine with User-Friendly and Scalable Rendering Features and structures 7

A GPU Computation-Based Ray Tracing Engine with User-Friendl...

引用

7th international conference on Computer Graphics and Virtuality, ICCGV 2024

作者： Yu, Yansong Du, Zhenlong College of Computer and Information Science Nanjing Tech University Nanjing China

ISBN: (数字)9781510679788

ISBN: (纸本)9781510679771

Realistic rendering involves the creation of visually realistic images through computer graphics techniques, commonly applied in fields such as film, video games, and computer-aided design. Recent advancements in modern computer architectures and graphics cards have propelled the rapid progress of ray-traced realistic rendering. Formerly confined to offline rendering, these algorithms are now gradually transitioning into real-time computing. While rendering times and processes for realistic rendering have become more straightforward and accessible, implementing rendering algorithms remains a challenge for beginners lacking coding experience. Generic graphics APIs like Vulkan and DirectX, though powerful, demand a significant investment of time for mastery. the implementation process further involves considerations of overall architectural design, algorithm selection, and future scalability. In addition to these challenges, industrial renderers, while offering mature rendering systems, often contain low-level implementations with software-specific APIs and magic numbers. these intricacies can cause confusion and make it nearly impossible for individual developers to extend the system. To overcome these obstacles, this paper aims to enhance accessibility for rendering enthusiasts by constructing a ray-traced realistic rendering engine based on OpenGL. the engine exhibits characteristics such as strong extensibility and ease of use. Furthermore, a clear and efficient CPU-GPU data transfer framework is designed. © 2024 SPIE.

关键词： Ray tracing

来源：评论

学校读者我要写书评

暂无评论

A Generic Construction for Crossovers of Graph-Like structures 15th

A Generic Construction for Crossovers of Graph-Like Structur...

引用

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

作者： Taentzer, Gabriele John, Stefan Kosiol, Jens Philipps Univ Marburg Marburg Germany

ISBN: (纸本)9783031098437;9783031098420

In model-driven optimization (MDO), domain-specific models are used to define and solve optimization problems with evolutionary algorithms. Models are typically evolved using mutations, which can be formally specified as graph transformations. So far, only mutations have been used in MDO to generate new solutions from existing ones;a crossover mechanism has not yet been elaborated. In this paper, we present a generic crossover construction for graph-like structures that can be used to implement crossover operators in MDO. We prove basic properties of our construction and show how it can be used to implement a whole set of crossover operators that have been proposed for specific problems and situations on graphs.

关键词： Evolutionary computation Crossover Model-driven optimization Category theory

来源：评论

学校读者我要写书评

暂无评论

Face Landmark Detection Based on Deep Learning Processor Unit on ZYNQ MPSoC 7

Face Landmark Detection Based on Deep Learning Processor Uni...

引用

7th international conference on Intelligent Computing and Signal Processing, ICSP 2022

作者： Liu, Weizhuang Tan, Kejun Dalian Maritime University Information Science Technology College Liaoning Province Dalian City China

ISBN: (纸本)9781665478571

Convolutional neural network (CNN) has a wide range of applications in face detection and recognition, image classification and semantic segmentation, but it is very difficult to deploy CNN on FPGA embedded platform. the Deep Learning Processor Unit (DPU) released by Xilinx is different from the previous deployment of FPGA, which can accelerate the realization of CNN deployment on FPGA platform and supports a variety of classical CNN structures. In this paper, the face and landmark detection CNN is deployed on ZCU102 platform using DPU based on idea of hardware and software co-design. According to the network features supported by DPU, Normalize network features in VGG-SSD were adjusted to BatchNormalize network features, Convolution was added in LeNet and a double-layer convolution structure was adopted, and the model was pruned to reduce resource consumption and computation. Dual-core DPU and deep flow architecture were used to improve data throughput. the experimental results show that the average detection time of single frame video image face and landmark detection is 26ms, and this design improves the acceleration effect significantly, and has good scalability. © 2022 IEEE.

关键词： System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Sweedler theory of Monads 25th

Sweedler Theory of Monads

引用

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)

作者： McDermott, Dylan Rivas, Exequiel Uustalu, Tarmo Reykjavik Univ Dept Comp Sci IS-102 Reykjavik Iceland Tallinn Univ Technol Dept Software Sci Tallinn Estonia

ISBN: (纸本)9783030992538;9783030992521

Monad-comonad interaction laws are a mathematical concept for describing communication protocols between effectful computations and coeffectful environments in the paradigm where notions of effectful computation are modelled by monads and notions of coeffectful environment by comonads. We show that monad-comonad interaction laws are an instance of measuring maps from Sweedler theory for duoidal categories whereby the final interacting comonad for a monad and a residual monad arises as the Sweedler hom and the initial residual monad for a monad and an interacting comonad as the Sweedler copower. We then combine this with a (co)algebraic characterization of monadcomonad interaction laws to derive descriptions of the Sweedler hom and the Sweedler copower in terms of their coalgebras resp. algebras.

关键词： (co)monads (co)algebras interaction laws runners duoidal categories Sweedler operations

来源：评论

学校读者我要写书评

暂无评论

Fair Quantitative Games 28th

Fair Quantitative Games

引用

作者： Anand, Ashwani Nayak, Satya Prakash Raha, Ritam Sağlam, Irmak Schmuck, Anne-Kathrin Max Planck Institute for Software Systems Kaiserslautern Germany

ISBN: (纸本)9783031908965

We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objective. the specific fairness we consider is called strong transition fairness, given by a subset of edges of one of the players, which asks the player to take fair edges infinitely often if their source nodes are visited infinitely often. We show that when fairness is imposed on player 1, these games fall within the class of previously studied ω-regular mean-payoff and energy games. On the other hand, when the fairness is on player 2, to the best of our knowledge, these games have not been previously studied. We provide gadget-based algorithms for fair mean-payoff games where fairness is imposed on either player, and for fair energy games where the fairness is imposed on player 1. For all variants of fair mean-payoff and fair energy (under unknown initial credit) games, we give pseudo-polynomial algorithms to compute the winning regions of both players. Additionally, we analyze the strategy complexities required for these games. Our work is the first to extend the study of strong transition fairness, as well as gadget-based approaches, to the quantitative setting. We thereby demonstrate that the simplicity of strong transition fairness, as well as the applicability of gadget-based techniques, can be leveraged beyond the ω-regular domain. © the Author(s) 2025.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Model Checking Temporal Properties of Recursive Probabilistic Programs 25th

Model Checking Temporal Properties of Recursive Probabilisti...

引用

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)

作者： Winkler, Tobias Gehnen, Christina Katoen, Joost-Pieter Rhein Westfal TH Aachen Aachen Germany

ISBN: (纸本)9783030992538;9783030992521

Probabilistic pushdown automata (pPDA) are a standard operational model for programming languages involving discrete random choices, procedures, and returns. Temporal properties are useful for gaining insight into the chronological order of events during program execution. Existing approaches in the literature have focused mostly on w-regular and LTL properties. In this paper, we study the model checking problem of pPDA against w-visibly pushdown languages that can be described by specification logics such as CaRet and are strictly more expressive than w-regular properties. With these logical formulae, it is possible to specify properties that explicitly take the structured computations arising from procedural programs into account. For example, CaRet is able to match procedure calls with their corresponding future returns, and thus allows to express fundamental program properties like total and partial correctness.

关键词： Probabilistic Recursive Programs Model Checking Probabilistic Pushdown Automata Visibly Pushdown Languages CaRet

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：