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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

982 篇 会议
37 篇 期刊文献
25 册 图书

馆藏范围

1,042 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

703 篇 工学
- 584 篇 计算机科学与技术...
- 367 篇 软件工程
- 146 篇 电气工程
- 56 篇 控制科学与工程
- 30 篇 信息与通信工程
- 27 篇 材料科学与工程（可...
- 19 篇 电子科学与技术（可...
- 16 篇 机械工程
- 11 篇 动力工程及工程热...
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 7 篇 仪器科学与技术
- 7 篇 石油与天然气工程
- 6 篇 城乡规划学
- 4 篇 核科学与技术
- 4 篇 农业工程
188 篇 理学
- 155 篇 数学
- 18 篇 系统科学
- 17 篇 物理学
- 12 篇 统计学（可授理学、...
- 10 篇 生物学
69 篇 管理学
- 53 篇 管理科学与工程(可...
- 22 篇 工商管理
- 19 篇 图书情报与档案管...
16 篇 教育学
- 16 篇 教育学
11 篇 文学
- 11 篇 新闻传播学
9 篇 法学
- 8 篇 社会学
6 篇 医学
- 4 篇 基础医学(可授医学...
4 篇 农学
- 4 篇 作物学
3 篇 经济学
- 3 篇 应用经济学
1 篇 军事学

主题

96 篇 logic gates
77 篇 programming
62 篇 logic programmin...
40 篇 fuzzy logic
35 篇 application soft...
30 篇 probabilistic lo...
29 篇 linear programmi...
27 篇 programming prof...
27 篇 computer archite...
26 篇 computer science
26 篇 dynamic programm...
23 篇 software enginee...
23 篇 protocols
21 篇 uncertainty
20 篇 object oriented ...
20 篇 java
20 篇 semantics
18 篇 computer circuit...
18 篇 costs
17 篇 software systems

机构

4 篇 univ potsdam pot...
4 篇 vienna univ tech...
4 篇 imdea software i...
4 篇 institute for lo...
3 篇 tu wien austria
3 篇 graduate school ...
3 篇 univ calabria de...
3 篇 carnegie mellon ...
3 篇 univ freiburg fr...
3 篇 univ british col...
3 篇 imperial coll lo...
3 篇 department of in...
2 篇 univ tecn federi...
2 篇 ist austria klos...
2 篇 univ savoie savo...
2 篇 tel aviv univers...
2 篇 zhongguancun lab...
2 篇 univ ferrara dip...
2 篇 south china univ...
2 篇 univ neuchatel i...

作者

8 篇 alviano mario
6 篇 lamma evelina
5 篇 schaub torsten
4 篇 riguzzi fabrizio
3 篇 lin yu
3 篇 vardi moshe y.
3 篇 gebser martin
3 篇 bellodi elena
3 篇 costa vitor sant...
3 篇 shinji sakamoto
3 篇 lakemeyer gerhar...
3 篇 ikeda markus
3 篇 zhou neng-fa
3 篇 xu hongxiang
3 篇 sabuncu orkunt
3 篇 leonard barolli
3 篇 schockaert steve...
3 篇 pichler andreas
3 篇 wang bin
3 篇 de givry simon

语言

1,023 篇 英文
14 篇 其他
8 篇 中文
1 篇 法文

检索条件"任意字段=30th International Conference on Logic Programming"

共 1044 条记录，以下是271-280 订阅

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

详细简洁

排序：

Advantages of Applying a Multi-agent Approach in Simulation Modeling: a Data-to-Action Case Study Applied to Electricity Production

Advantages of Applying a Multi-agent Approach in Simulation ...

引用

National conference with international Participation (TELECOM)

作者： Krassimir Stoyanov Varbinka Stefanova-Stoyanova Petko Danov Department of Computer Systems Faculty of Computer Systems and Technologies Technical University of Sofia Sofia Bulgaria Department of Programming and Computer Technologies Faculty of Computer Systems and Technologies Technical University of Sofia Sofia Bulgaria

ISBN: (纸本)9781665482134

this article examines modern methods for analysis and dynamic process modeling with the context of the capabilities, characteristics and advantages of types of multiagent systems. A practical implementation of the “Data to Action” model is proposed through the research simulation modeling system “Photovoltaic (PV) to Smart Energy Storage (SES) Grid”, developed by the authors using a Multi-Agent System for simulating the process of generating electricity produced by a PV park, its storage with the possibility of Time-Shifting and sale of energy.

关键词： Photovoltaic systems Process modeling Production Data models Telecommunications Multi-agent systems Energy storage

来源：评论

学校读者我要写书评

暂无评论

Learn the Switches: Evolving FPGA NoCs with Stall-Free and Backpressure based Routers 30

Learn the Switches: Evolving FPGA NoCs with Stall-Free and B...

引用

30th international conference on Field-Programmable logic and Applications (FPL)

作者： Malik, Gurshaant Lang, Ian Elmor Pellizoni, Rodolfo Kapre, Nachiket Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9781728199023

We can overcome the pessimism in worst-case routing latency analysis of timing-predictable Network-on-Chip (NoC) workloads by single digit factors through the use of a hybrid FPGA-optimized NoC. Timing-predictable FPGA-optimized NoCs such as HopliteBuf integrate stall-free FIFOs that are sized using offline, static analysis of a user-supplied flow pattern and rates. For certain bursty traffic and flow configurations, the static analysis delivers very large, sometimes infeasible, FIFO size bounds and large worst-case latency bounds. Alternatively, backpressure-based NoCs such as HopliteBP can operate with lower latencies for certain bursty flows. However, they suffer from severe pessimism in the analysis due to the effect of pipelining of packets and interleaving of flows at switch ports. As we show in this paper, a hybrid FPGA NoC that seamlessly composes both design styles on a per-switch basis, delivers the best of both worlds with improved feasibility (bounded operation), and tighter latency bounds. We select the NoC switch configuration though a novel evolutionary algorithm based on Maximum Likelihood Estimation (MLE). For synthetic (RANDOM, LOCAL) and real world (SpMV, Graph) workloads, we demonstrate approximate to 2-3x improvements in feasibility, approximate to 1-6.8x in worst-case latency while only requiring LUT cost approximate to 1-1.5x larger than the cheapest HopliteBuf solution. We also deploy and verify our NoC (PL) and MLE framework (PS) on a Pynq-Z1 to adapt and reconfigure NoC switches dynamically.

关键词： Architectures and Technology Methods and Tools programming Models

来源：评论

学校读者我要写书评

暂无评论

MRC 2021 - Proceedings of the 12th international Workshop Modelling and Reasoning in Context, co-located with the 30th international Joint conference on Artificial Intelligence, IJCAI 2021

MRC 2021 - Proceedings of the 12th International Workshop Mo...

引用

12th international Workshop Modelling and Reasoning in Context, MRC 2021

the proceedings contain 7 papers. the topics discussed include: bi-ISCA: bidirectional inter-sentence contextual attention mechanism for detecting sarcasm in user generated noisy short text;modelling and reasoning for indirect sensing over discrete-time via Markov logic networks;streaming and learning the personal context;explainable AI: a narrative review at the crossroad of knowledge discovery, knowledge representation and representation learning;intrinsic, dialogic, and impact measures of success for explainable ai;people in the context - an analysis of game-based experimental protocol;and Bartle taxonomy-based game for affective and personality computing research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Faster-LTN: A Neuro-Symbolic, End-to-End Object Detection Architecture 1

引用

30th international conference on Artificial Neural Networks (ICANN)

作者： Manigrasso, Francesco Miro, Filomeno Davide Morra, Lia Lamberti, Fabrizio Politecn Torino Dipartimento Automat & Informat Turin Italy

ISBN: (数字)9783030863401

ISBN: (纸本)9783030863401;9783030863395

the detection of semantic relationships between objects represented in an image is one of the fundamental challenges in image interpretation. Neural-Symbolic techniques, such as logic Tensor Networks (LTNs), allow the combination of semantic knowledge representation and reasoning with the ability to efficiently learn from examples typical of neural networks. We here propose Faster-LTN, an object detector composed of a convolutional backbone and an LTN. To the best of our knowledge, this is the first attempt to combine both frameworks in an end-to-end training setting. this architecture is trained by optimizing a grounded theory which combines labelled examples with prior knowledge, in the form of logical axioms. Experimental comparisons show competitive performance with respect to the traditional Faster R-CNN architecture.

关键词： Object detection NeuroSymbolic AI Convolutional neural network logic tensor networks

来源：评论

学校读者我要写书评

暂无评论

Constraint Tableaux for Two-Dimensional Fuzzy logics 30th

Constraint Tableaux for Two-Dimensional Fuzzy Logics

引用

30th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Bilkova, Marta Frittella, Sabine Kozhemiachenko, Daniil Czech Acad Sci Inst Comp Sci Prague Czech Republic Univ Orleans INSA Ctr Val Loire LIFO EA 4022 Bourges France

ISBN: (纸本)9783030860592;9783030860585

We introduce two-dimensional logics based on Lukasiewicz and Godel logics to formalize reasoning with graded, incomplete and inconsistent information. the logics are interpreted on matrices, where the common underlying structure is the bi-lattice (twisted) product of the [0, 1] interval. the first (resp. second) coordinate encodes the positive (resp. negative) information one has about a statement. We propose constraint tableaux that provide a modular framework to address their completeness and complexity.

关键词： Constraint tableaux Lukasiewicz logic Godel logic Two-dimensional logics

来源：评论

学校读者我要写书评

暂无评论

A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense logic 30th

A Formally Verified Cut-Elimination Procedure for Linear Nes...

引用

30th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： D'Abrera, Caitlin Dawson, Jeremy Gore, Rajeev Australian Natl Univ Sch Comp Canberra ACT Australia Vienna Univ Technol Vienna Austria

ISBN: (纸本)9783030860592;9783030860585

We port Dawson and Gore's general framework of deep embeddings of derivability from Isabelle to Coq. By using lists instead of multisets to encode sequents, we enable the encoding of genuinely substructural logics in which some combination of exchange, weakening and contraction are not admissible. We then show how to extend the framework to encode the linear nested sequent calculus LNSKt of Gore and Lellmann for the tense logic Kt and prove cut-elimination and all required proof-theoretic theorems in Coq, based on their pen-and-paper proofs. Finally, we extract the proof of the cut-elimination theorem to obtain a formally verified Haskell program that produces cut-free derivations from those with cut. We believe it is the first published formally verified computer program for eliminating cuts in any proof calculus.

关键词： Formalised proof theory Cut-elimination Linear nested sequent calculus Tense logic Coq Extraction Program synthesis

来源：评论

学校读者我要写书评

暂无评论

Proof-theory and Semantics for a theory of Definite Descriptions 30th

Proof-Theory and Semantics for a Theory of Definite Descript...

引用

30th international conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)

作者： Kuerbis, Nils Univ Lodz Dept Log & Methodol Sci Lodz Poland Univ Bochum Dept Philosophie 1 Bochum Germany

ISBN: (纸本)9783030860592;9783030860585

this paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means 'the F is G'. this approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to be sound and complete for the semantics. the system has a number of novel features and is briefly compared to the usual approach of formalising 'the F' by a term forming operator. It does not coincide with Hintikka's and Lambert's preferred theories, but the divergence is well-motivated and attractive.

关键词： Definite descriptions Positive free logic Proof theory Sequent calculus Cut elimination Dual domain semantics

来源：评论

学校读者我要写书评

暂无评论

Declarative Goal Mediation in Smart Environments 7

Declarative Goal Mediation in Smart Environments

引用

7th IEEE international conference on Smart Computing (SMARTCOMP)

作者： Bisicchia, Giuseppe Forti, Stefano Brogi, Antonio Univ Pisa Dept Comp Sci Pisa Italy

ISBN: (纸本)9781665412520

Smart environments enabled by the Internet of things aim at improving our daily lives by automatically tuning ambient parameters and by achieving energy savings through self-managing cyber-physical systems. Commercial solutions, however, only permit setting simple target goals on those parameters and do not mediate between conflicting goals among different users and/or system administrators, nor across different IoT verticals. In this article, we propose a declarative approach (and its open-source Prolog prototype) to represent smart environments, user-set goals and customisable mediation policies to reconcile contrasting goals across multiple IoT systems.

关键词： Goal-oriented systems Smart Environments Internet of things logic programming

来源：评论

学校读者我要写书评

暂无评论

Improved Acyclicity Reasoning for Bayesian Network Structure Learning with Constraint programming 30

Improved Acyclicity Reasoning for Bayesian Network Structure...

引用

30th international Joint conference on Artificial Intelligence (IJCAI)

作者： Trosser, Fulya de Givry, Simon Katsirelos, George Univ Toulouse INRAE UR MIAT F-31320 Castanet Tolosan France Univ Paris Saclay UMR MIA Paris INRAE AgroParisTech F-75005 Paris France

ISBN: (纸本)9780999241196

Bayesian networks are probabilistic graphical models with a wide range of application areas including gene regulatory networks inference, risk analysis and image processing. Learning the structure of a Bayesian network (BNSL) from discrete data is known to be an NP-hard task with a superexponential search space of directed acyclic graphs. In this work, we propose a new polynomial time algorithm for discovering a subset of all possible cluster cuts, a greedy algorithm for approximately solving the resulting linear program, and a generalised arc consistency algorithm for the acyclicity constraint. We embed these in the constraint programmingbased branch-and-bound solver CPBayes and show that, despite being suboptimal, they improve performance by orders of magnitude. the resulting solver also compares favourably with GOBNILP, a state-of-the-art solver for the BNSL problem which solves an NP-hard problem to discover each cut and solves the linear program exactly.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Good-Enough Strategies for LTL f Specifications 30

Synthesizing Good-Enough Strategies for LTL f Specifications

引用

30th international Joint conference on Artificial Intelligence (IJCAI)

作者： Li, Yong Turrini, Andrea Vardi, Moshe Y. Zhang, Lijun Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing Peoples R China Inst Intelligent Software Guangzhou Peoples R China Rice Univ Houston TX USA

ISBN: (纸本)9780999241196

We consider the problem of synthesizing goodenough (GE)-strategies for Linear Temporal logic (LTL) over finite traces or LTL (f) for short. the problem of synthesizing GE-strategies for an LTL formula phi over infinite traces reduces to the problem of synthesizing winning strategies for the formula (there exists O phi) double right arrow phi, where O is the set of propositions controlled by the system. We first prove that this reduction does not work for LTL (f) formulas. then we show how to synthesize GE-strategies for LTL (f) formulas via the Good-Enough (GE)synthesis of LTL formulas. Unfortunately, this requires to construct deterministic parity automata on infinite words, which is computationally expensive. We then show how to synthesize GE-strategies for LTL (f) formulas by a reduction to solving games played on deterministic Buchi automata, based on an easier construction of deterministic automata on finite words. We show empirically that our specialized synthesis algorithm for GE-strategies outperforms the algorithms going through GE-synthesis of LTL formulas by orders of magnitude.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：