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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,053 篇 会议
51 册 图书
46 篇 期刊文献

馆藏范围

2,150 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,274 篇 工学
- 1,024 篇 计算机科学与技术...
- 583 篇 软件工程
- 254 篇 电气工程
- 157 篇 控制科学与工程
- 69 篇 信息与通信工程
- 50 篇 机械工程
- 42 篇 材料科学与工程（可...
- 36 篇 电子科学与技术（可...
- 18 篇 安全科学与工程
- 15 篇 交通运输工程
- 12 篇 仪器科学与技术
- 12 篇 土木工程
- 12 篇 化学工程与技术
- 12 篇 生物医学工程（可授...
- 12 篇 生物工程
- 11 篇 冶金工程
- 11 篇 动力工程及工程热...
- 10 篇 建筑学
296 篇 理学
- 227 篇 数学
- 39 篇 物理学
- 39 篇 统计学（可授理学、...
- 34 篇 系统科学
- 22 篇 生物学
- 16 篇 化学
119 篇 管理学
- 84 篇 管理科学与工程(可...
- 37 篇 工商管理
- 32 篇 图书情报与档案管...
47 篇 教育学
- 46 篇 教育学
25 篇 医学
- 24 篇 临床医学
10 篇 法学
- 10 篇 社会学
9 篇 经济学
5 篇 农学
4 篇 文学

主题

172 篇 logic gates
137 篇 fuzzy logic
129 篇 programming
118 篇 linear programmi...
94 篇 logic programmin...
65 篇 probabilistic lo...
59 篇 dynamic programm...
57 篇 optimization
52 篇 semantics
50 篇 training
49 篇 computer science
48 篇 logic
44 篇 object oriented ...
42 篇 computer archite...
41 篇 computational mo...
38 篇 hardware
38 篇 artificial intel...
37 篇 java
36 篇 computer program...
35 篇 software

机构

6 篇 laboratory of co...
5 篇 stevens inst tec...
5 篇 institute of log...
5 篇 university of to...
5 篇 institute for lo...
5 篇 chinese univ hon...
4 篇 univ oxford oxfo...
4 篇 school of electr...
4 篇 ibm corp thomas ...
3 篇 north carolina s...
3 篇 creighton univ o...
3 篇 univ politecn ca...
3 篇 ecole polytech f...
3 篇 tu wien austria
3 篇 department of co...
3 篇 department of el...
3 篇 rhein westfal th...
3 篇 school of comput...
3 篇 univ tokyo
3 篇 school of mathem...

作者

7 篇 inoue katsumi
5 篇 sakama chiaki
5 篇 gupta gopal
4 篇 wang liang
4 篇 iosif radu
4 篇 pontelli enrico
4 篇 liang wang
4 篇 tompits hans
4 篇 beck j. christop...
3 篇 kumar amruth n.
3 篇 chopra amit k.
3 篇 proietti maurizi...
3 篇 il han park
3 篇 m.-r. akbarzadeh...
3 篇 wei li
3 篇 riguzzi fabrizio
3 篇 schaub torsten
3 篇 melin p
3 篇 leonidas deligia...
3 篇 mcdirmid sean

语言

2,101 篇 英文
35 篇 其他
15 篇 中文
2 篇 葡萄牙文
1 篇 西班牙文
1 篇 法文

检索条件"任意字段=22nd International Conference on Logic Programming"

共 2150 条记录，以下是691-700 订阅

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

详细简洁

排序：

A Dialectica-Like Interpretation of a Linear MSO on Infinite Words 22nd

A Dialectica-Like Interpretation of a Linear MSO on Infinite...

引用

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)

作者： Pradic, Pierre Riba, Colin Univ Lyon LIP ENS Lyon UMR 5668CNRSUCBLInria Lyon France Univ Warsaw Fac Math Informat & Mech Warsaw Poland

ISBN: (纸本)9783030171278;9783030171261

We devise a variant of Dialectica interpretation of intuitionistic linear logic for LMSO, a linear logic-based version MSO over infinite words. LMSO was known to be correct and complete w.r.t. Church's synthesis, thanks to an automata-based realizability model. Invoking Buchi-Landweber Theorem and building on a complete axiomatization of MSO on infinite words, our interpretation provides us with a syntactic approach, without any further construction of automata on infinite words. Via Dialectica, as linear negation directly corresponds to switching players in games, we furthermore obtain a complete logic: either a closed formula or its linear negation is provable. This completely axiomatizes the theory of the realizability model of LMSO. Besides, this shows that in principle, one can solve Church's synthesis for a given for all there exists-formula by only looking for proofs of either that formula or its linear negation.

关键词： Linear logic Dialectica interpretation MSO on Infinite Words

来源：评论

学校读者我要写书评

暂无评论

Robust optimization in production engineering-methods and application 22

Robust optimization in production engineering-methods and ap...

引用

22nd international Scientific conference on Progress of Mechanical Engineering Supported by Information Technology, POLSITA 2019

作者： Knapczyk, Adrian Francik, Slawomir Jewiarz, Marcin Mudryk, Krzysztof Wróbel, Marek University of Agriculture in Krakow Faculty of Production and Power Engineering Department of Mechanical Engineering and Agrophysics Balicka 120 Krakow30-149 Poland

Methods that use robust optimization are aimed at finding robustness to decision uncertainty. Uncertainty may affect the input parameters (problem) and the final solution. Robust optimization is applicable in many areas, such as: operational research, IT, energy, production engineering and others. The aim of the work was to indicate the main methods and examples of applications of robust optimization in the area of production engineering. Documents (articles and proceedings paper) indexed in the Web of Science-Core Collection database (WoSCC) from 2014-2018 were used for analysis. The search has been limited to the WoS-CC category: Engineering Industrial and Engineering Manufacturing. The main areas of application were: the scheduling of projects and tasks, production planning, and risk management. The most common methods were: linear programming, evolutionary algorithms, mixed integer programming, dynamic programming and many others. © 2019 The Authors, published by EDP Sciences.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Metric Temporal Graph logic over Typed Attributed Graphs 22nd

Metric Temporal Graph Logic over Typed Attributed Graphs

引用

22nd 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)

作者： Giese, Holger Maximova, Maria Sakizloglou, Lucas Schneider, Sven Univ Potsdam Hasso Plattner Inst Potsdam Germany

ISBN: (纸本)9783030167226;9783030167219

Various kinds of typed attributed graphs can be used to represent states of systems from a broad range of domains. For dynamic systems, established formalisms such as graph transformation can provide a formal model for defining state sequences. We consider the case where time may elapse between state changes and introduce a logic, called Metric Temporal Graph logic (MTGL), to reason about such timed graph sequences. With this logic, we express properties on the structure and attributes of states as well as on the occurrence of states over time that are related by their inner structure, which no formal logic over graphs concisely accomplishes so far. Firstly, based on timed graph sequences as models for system evolution, we define MTGL by integrating the temporal operator until with time bounds into the well-established logic of (nested) graph conditions. Secondly, we outline how a finite timed graph sequence can be represented as a single graph containing all changes over time (called graph with history), how the satisfaction of MTGL conditions can be defined for such a graph and show that both representations satisfy the same MTGL conditions. Thirdly, we present how MTGL conditions can be reduced to (nested) graph conditions and show using this reduction that both underlying logics are equally expressive. Finally, we present an extension of the tool AutoGraph allowing to check the satisfaction of MTGL conditions for timed graph sequences, by checking the satisfaction of the (nested) graph conditions, obtained using the proposed reduction, for the graph with history corresponding to the timed graph sequence.

关键词： Nested graph conditions Metric temporal logic Sequence properties Typed attributed graphs Symbolic graphs

来源：评论

学校读者我要写书评

暂无评论

Strong Adequacy and Untyped Full-Abstraction for Probabilistic Coherence Spaces 22nd

Strong Adequacy and Untyped Full-Abstraction for Probabilist...

引用

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)

作者： Leventis, Thomas Pagani, Michele Univ Paris Diderot CNRS Sorbonne Paris Cite IRIF UMR 8243 Paris France Univ Bologna Bologna Italy

ISBN: (纸本)9783030171278;9783030171261

We consider the probabilistic untyped lambda-calculus and prove a stronger form of the adequacy property for probabilistic coherence spaces (PCoh), showing how the denotation of a term statistically distributes over the denotations of its head-normal forms. We use this result to state a precise correspondence between PCoh and a notion of probabilistic Nakajima trees, recently introduced by Leventis in order to prove a separation theorem. As a consequence, we get full abstraction for PCoh. This latter result has already been mentioned as a corollary of Clairambault and Paquet's full abstraction theorem for probabilistic concurrent games. Our approach allows to prove the property directly, without the need of a third model.

关键词： Lambda-Calculus Denotational semantics Probabilistic functional programming

来源：评论

学校读者我要写书评

暂无评论

Towards an Open-Source Framework for Jointly Emulating Control and Data Planes of Disaggregated Optical Networks

Towards an Open-Source Framework for Jointly Emulating Contr...

引用

international conference on Transparent Optical Networks

作者： Ignacio Iglesias-Castreño Miquel Garrich Alabarce Manu Hernández-Bastida Pablo Pavón Mariño E-lighthouse Networks Solutions Calle Ángel s/n Cartagena Spain

ISBN: (数字)9781728184234

ISBN: (纸本)9781728184241

Software Defined Networking (SDN) principles in optical networks pursue disaggregated approaches, in which optical equipment is governed by the SDN controller with standard interfaces and common modelling abstractions. Software agents are a fundamental piece in disaggregated optical networks because they translate the commands from the SDN controller into specific actions to be performed by hardware equipment. In this paper, we rely on an existing framework for constructing software agents (Netopeer2-Sysrepo) and we discuss the common approach for the interaction between software agents and hardware equipment. Then, we report our preliminary advancements towards an optical emulation framework built on top of an automatic creation of agents. We use the OpenConfig-based model of Cassini and its ONOS driver, which are recent developments within TIP and ODTN initiatives, respectively.

关键词： Optical fiber networks Software agents Protocols Integrated optics Topology logic gates Computer architecture

来源：评论

学校读者我要写书评

暂无评论

VIAP 1.1 (Competition Contribution) 25th

VIAP 1.1 (Competition Contribution)

引用

25th international conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS) held as part of the 22nd European Joint conferences on Theory and Practice of Software (ETAPS)

作者： Rajkhowa, Pritom Lin, Fangzhen Hong Kong Univ Sci & Technol Dept Comp Sci & Engn Kowloon Clear Water Bay Hong Kong Peoples R China

ISBN: (纸本)9783030175023;9783030175016

VIAP (Verifier for Integer Assignment Programs) is an automated system for verifying safety properties of procedural programs with integer assignments and loops. It is based on a translation from of a program to a set of first-order axioms with quantification over natural numbers, and currently makes use of SymPy as the algebraic simplifier and the SMT solver Z3 as the theorem prover. Our first version of the system competed at SV-COMP 2018. This paper describes VIAP 1.1, a new version that makes use of our newly developed recurrence solver. As a result, VIAP 1.1. is able to verify many programs that were out of reach for the older version VIAP 1.0.

关键词： Automatic program verification First-order logic Mathematical induction Recurrences SMT Arithmetic

来源：评论

学校读者我要写书评

暂无评论

Automatic Verification of C and Java Programs: SV-COMP 2019 25th

Automatic Verification of C and Java Programs: SV-COMP 2019

引用

作者： Beyer, Dirk Ludwig Maximilians Univ Munchen Munich Germany

ISBN: (纸本)9783030175023;9783030175016

This report describes the 2019 Competition on Software Verification (SV-COMP), the 8th edition of a series of comparative evaluations of fully automatic software verifiers for C programs, and now also for Java programs. The competition provides a snapshot of the current state of the art in the area, and has a strong focus on replicability of its results. The repository of benchmark verification tasks now supports a new, more flexible format for task definitions (based on YAML), which was a precondition for conveniently benchmarking Java programs in the same controlled competition setting that was successfully applied in the previous years. The competition was based on 10 522 verification tasks for C programs and 368 verification tasks for Java programs. Each verification task consisted of a program and a property (reachability, memory safety, overflows, termination). SV-COMP 2019 had 31 participating verification systems from 14 countries.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

ESBMC v6.0: Verifying C Programs Using k-Induction and Invariant Inference (Competition Contribution) 25th

ESBMC v6.0: Verifying C Programs Using k-Induction and Invar...

引用

作者： Gadelha, Mikhail R. Monteiro, Felipe Cordeiro, Lucas Nicole, Denis SIDIA Inst Ciencia & Tecnol Manaus Amazonas Brazil Univ Fed Amazonas Manaus Amazonas Brazil Univ Manchester Manchester Lancs England Univ Southampton Southampton Hants England

ISBN: (纸本)9783030175023;9783030175016

ESBMC v6.0 employs a k-induction algorithm to both falsify and prove safety properties in C programs. We have developed a new interval-invariant generator that pre-processes the program, inferring invariants based on intervals and introducing them in the program as assumptions. Our experiments show that ESBMC v6.0 using k-induction can prove up to 7% more programs when the invariant generation is enabled.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

22nd international conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019

22nd International Conference on Principles and Practice of ...

引用

22nd international conference on Principles and Practice of Multi-Agent Systems, PRIMA 2019

ISBN: (纸本)9783030337919

The proceedings contain 50 papers. The special focus in this conference is on Principles and Practice of Multi-Agent Systems. The topics include: Coordination of Mobile Agents for Simultaneous Coverage;MCTS-Based Automated Negotiation Agent;Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT logics;selfish Mining in Proof-of-Work Blockchain with Multiple Miners: An Empirical Evaluation;a Co-evolutionary Approach to Analyzing the Impact of Rationality on the Italian Electricity Market;modelling Shared Decision Making in Medical Negotiations: Interactive Training with Cognitive Agents;doxastic Group Reasoning via Multiple Belief Shadowing;subset Spaces for Conditional Norms;Integrating CP-Nets in Reactive BDI Agents;K-ACE: A Flexible Environment for Knowledge-Aware Multi-Agent Systems;SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location;solving Coalition Structure Generation Problems over Weighted Graph;from Good Intentions to Behaviour Change: Probabilistic Feature Diagrams for Behaviour Support Agents;identifying Belief Sequences in a Network of Communicating Agents;non-monotonic Collective Decisions;a Coalitional Algorithm for Recursive Delegation;compact Frequency Memory for Reinforcement Learning with Hidden States;leveraging Symmetric Relations for Approximation Coalition Structure Generation;deception/Honesty Detection and (Mis)trust Building in Manipulable Multi-Agent Argumentation: An Insight;self-vehicle Positioning Using Smart Infrastructures;formal Analysis of Responsibility Attribution in a Multimodal Framework;a Combined Netflow-Driven and Agent-Based Social Modeling Approach for Building Evacuation;imperfect Information in Alternating-Time Temporal logic on Finite Traces;TAMER: Task Allocation in Multi-robot Systems Through an Entity-Relationship Model;a Modeling Environment for Reified Temporal-Causal Networks: Modeling Plasticity and Metaplasticity in Cognitive Agent Models;modeling Higher-Order Adap

关键词：

来源：评论

学校读者我要写书评

暂无评论

Represent The Discovered Proportional Information Control Net Using Extended XPDL Format

Represent The Discovered Proportional Information Control Ne...

引用

international conference on Advanced Communication Technology (ICACT)

作者： Dinh-Lam Pham Hyun Ahn Kyoung-Sook Kim Kwanghoon Pio Kim Division of Computer Science and Engineering Data and Process Engineering Research Lab. KYONGGI UNIVERSITY Gyeonggi-Do Republic of Korea

ISBN: (数字)9791188428045

ISBN: (纸本)9781728149431

The XML Process Definition Language (XPDL) is a widely used XML format for storing and exchanging business process information from various workflow systems. In this paper, we introduce the methodology to represent the run-time proportional Information Control Net (pICN) discovered from the business process event log by using XPDL format. More precisely, we propose an approach and algorithm to export pICN data from the graphical visualization model to XPDL format (version 2.1) with several extended attributes to store run-time proportional information of activities in the system. By storing the discovered pICN in an XPDL format, we do not have to rediscover it again in the next mining time since using the information that has been recorded. With the popular and widespread use of the XPDL format, we can use the discovered pICN model in various business process management and workflow systems.

关键词： Unified modeling language Business Process control Petri nets logic gates Standards Tools

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共215页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：