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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

46 篇 会议
4 册 图书
4 篇 期刊文献

馆藏范围

54 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

44 篇 工学
- 42 篇 计算机科学与技术...
- 23 篇 软件工程
- 9 篇 控制科学与工程
- 6 篇 电气工程
- 4 篇 信息与通信工程
- 1 篇 机械工程
- 1 篇 生物医学工程（可授...
- 1 篇 食品科学与工程（可...
12 篇 理学
- 11 篇 数学
- 1 篇 物理学
- 1 篇 统计学（可授理学、...
5 篇 管理学
- 3 篇 图书情报与档案管...
- 2 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

11 篇 inductive logic ...
7 篇 logic programmin...
3 篇 computer circuit...
3 篇 software design
3 篇 statistical rela...
2 篇 software enginee...
2 篇 transfer learnin...
2 篇 abduction
2 篇 probabilistic ex...
2 篇 requirement anal...
2 篇 mathematical log...
2 篇 inductive logic ...
2 篇 model transforma...
2 篇 topology
2 篇 answer set progr...
2 篇 stochastic logic...
2 篇 transformation r...
2 篇 artificial intel...
2 篇 probabilistic in...
2 篇 logics and meani...

机构

4 篇 katholieke univ ...
3 篇 univ london impe...
2 篇 univ karlsruhe t...
2 篇 univ london impe...
2 篇 katholieke univ ...
2 篇 information and ...
2 篇 natl inst inform...
2 篇 univ leipzig dep...
1 篇 kuleuven leuven
1 篇 bits dept comp s...
1 篇 univ london impe...
1 篇 the pennsylvania...
1 篇 univ bologna dei...
1 篇 univ wisconsin d...
1 篇 univ dublin trin...
1 篇 czech tech univ ...
1 篇 telecommunicatio...
1 篇 northeastern uni...
1 篇 univ edinburgh e...
1 篇 cardiff univ sch...

作者

3 篇 muggleton stephe...
3 篇 lehmann jens
2 篇 de raedt luc
2 篇 santos jose
2 篇 ray oliver
2 篇 hitzler pascal
2 篇 schockaert steve...
2 篇 davis jesse
2 篇 chen jianzhong
2 篇 kuzelka ondrej
2 篇 inoue katsumi
2 篇 kimmig angelika
1 篇 hudli anand v.
1 篇 mark law
1 篇 driessens kurt
1 篇 lisi francesca a...
1 篇 daniel cunningto...
1 篇 bridewell will
1 篇 hirohisa seki
1 篇 cabral luciano

语言

53 篇 英文
1 篇 中文

检索条件"任意字段=24th International Conference on Inductive Logic Programming, ILP 2014"

共 54 条记录，以下是41-50 订阅

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

详细简洁

排序：

inductive logic programming 2007

引用

丛书名： Lecture Notes in Computer Science

2007年

作者： Stephen Muggleton Ramon Otero Alireza Tamaddoni-Nezhad

来源：评论

学校读者我要写书评

暂无评论

An inductive logic programming-based approach for ontology population from the web

An inductive logic programming-based approach for ontology p...

引用

24th international conference on Database and Expert Systems Applications, DEXA 2013

作者： Lima, Rinaldo Espinasse, Bernard Oliveira, Hilário Ferreira, Rafael Cabral, Luciano Filho, Dimas Freitas, Fred Gadelha, Renê Informatics Center Federal University of Pernambuco Recife Brazil LSIS Aix Marseille University Marseille France

ISBN: (纸本)9783642402845

Developing linguistically data-compliant rules for entity extraction is usually an intensive and time-consuming process for any ontology engineer. thus, an automated mechanism to convert textual data into ontology instances (Ontology Population) may be crucial. In this context, this paper presents an inductive logic programming-based method that induces rules for extracting instances of various entity classes. this method uses two sources of evidence: domain-independent linguistic patterns for identifying candidates of class instances, and a WordNet semantic similarity measure. these two evidences are integrated as background knowledge to automatically generate extractions rules by a generic inductive logic programming system. Some experiments were conducted on the class instance classification problem with encouraging results. © 2013 Springer-Verlag.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Function-Level Processor (FLP): Raising Efficiency by Operating at Function Granularity for Market-Oriented MPSoC

Function-Level Processor (FLP): Raising Efficiency by Operat...

引用

IEEE 25th international conference on Application-Specific Systems, Architectures and Processors (ASAP)

作者： Tabkhi, Hamed Bushey, Robert Schirner, Gunar Northeastern Univ Dept Elect & Comp Engn Boston MA 02115 USA Analog Devices Inc ADI Embedded Syst Prod & Technol Norwood MA USA

ISBN: (纸本)9781479936090

the exponential growth in computation demand drives chip vendors to heterogeneous architectures combining Instruction-Level Processors (ilps) and custom HW Accelerators (HWACCs) in an attempt to provide the needed processing capabilities while meeting power/energy requirements. ilps, on one hand, are highly flexible, but power inefficient. Custom HWACCs, on the other hand, are inflexible (focusing on dedicated kernels), but highly power efficient. Since, designing HWACCs for every application is cost prohibitive, large portions of applications still run inefficiently on ilps. New processing architectures are needed that combine the power efficiency of HWACCs while still retaining sufficient flexibility to realize applications across targeted market segments. this paper introduces Function-Level Processors (FLPs) to fill the gap between ilps and dedicated HWACCs. FLPs are comprised of configurable Function Blocks (FBs) implementing selected functions which are then interconnected via programmable point-to-point connections constructing an extensible/configurable macro data-path. An FLP raises programming abstraction to a Function-Set Architecture (FSA) controlling FBs allocation, configuration and scheduling. We demonstrate FLP benefits with an industry example of the Pipeline-Vision Processor (PVP). We highlight the gained flexibility by mapping 10 embedded vision applications entirely to the FLP-PVP offering up to 22.4 GOPs/s with average power of 120 mW. the results also demonstrate that our FLP-PVP solution consumes 14x-18x less power than an ilp and 5x less power than a hybrid ilp+ HWACCs solution.

关键词： fault-location problem PROCESSOR inductive logic programming dynamic efficiency Exponential Growth average power ARCHITECTURE Power (Psychology) Energy sources macro data Target marketing Connection points

来源：评论

学校读者我要写书评

暂无评论

Nominal Matching logic 22

Nominal Matching Logic

引用

24th international Symposium on Principles and Practice of Declarative programming, PPDP 2022

作者： Cheney, James Fernandez, Maribel Laboratory for Foundations of Computer Science University of Edinburgh Edinburgh United Kingdom Department of Informatics King s College London London United Kingdom

ISBN: (纸本)9781450397032

We introduce Nominal Matching logic (NML) as an extension of Matching logic with names and binding following the Gabbay-Pitts nominal approach. Matching logic is the foundation of the framework, used to specify programming languages and automatically derive associated tools (compilers, debuggers, model checkers, program verifiers). Matching logic does not include a primitive notion of name binding, though binding operators can be represented via an encoding that internalises the graph of a function from bound names to expressions containing bound names. this approach is sufficient to represent computations involving binding operators, but has not been reconciled with support for inductive reasoning over syntax with binding (e.g., reasoning over λ-terms). Nominal logic is a formal system for reasoning about names and binding, which provides well-behaved and powerful principles for inductive reasoning over syntax with binding, and NML inherits these principles. We discuss design alternatives for the syntax and the semantics of NML, prove meta-theoretical properties and give examples to illustrate its expressive power. In particular, we show how induction principles for λ-terms (α-structural induction) can be defined and used to prove standard properties of the λ-calculus. © 2022 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Towards Neural-Symbolic Learning to support Human-Agent Operations

Towards Neural-Symbolic Learning to support Human-Agent Oper...

引用

international conference on Information Fusion

作者： Daniel Cunnington Mark Law Alessandra Russo Jorge Lobo Lance Kaplan IBM Research Europe Hursley UK Imperial College London London UK Army Research Laboratory Adelphi MD USA

ISBN: (纸本)9781665414272

this paper investigates neural-symbolic policy learning for information fusion in distributed human-agent operations. the architecture integrates a pre-trained neural network for feature extraction, with a state-of-the-art symbolic inductive logic programming (ilp) system to learn policies, expressed as a set of logical rules. We firstly outline the challenge of policy learning within a military environment, by investigating the accuracy and confidence of neural network predictions given data outside the training distribution. Secondly, we introduce a neural-symbolic integration for policy learning and demonstrate that the symbolic ilp component, when considering the length of the learned policy rules, can generalise and learn a robust policy despite unstructured data observed at policy learning time originating from a different distribution than observed during training.

关键词： Training Uncertainty logic programming conferences Aggregates Neural networks Estimation

来源：评论

学校读者我要写书评

暂无评论

Cable Length Minimisation in Long-Reach-PON Planning for Sparsely Populated Areas

Cable Length Minimisation in Long-Reach-PON Planning for Spa...

引用

18th international conference on Optical Network Design and Modeling (ONDM)

作者： Pal, Saptadeep Zukowski, Cezary Nag, Avishek Payne, David B. Ruffini, Marco Univ Dublin Trinity Coll CTVR Dublin 2 Ireland

ISBN: (纸本)9783901882609

Tackling the digital divide has become one of the main goals of many governments around the world, and a main target for the European Commission. Fibre-to-the-premises (FTTP) is the only access technology that has the potential to totally eliminate the digital divide since, within access distances, fibre capacity can be considered distance independent. In practice, however the higher cost means that many rural areas might not be served by FTTP services, further widening the capacity gap between rural and urban access. However, while fibre roll out is certainly less cost-effective in rural than urban areas, a proper deployment strategy that minimises cable installation costs can increase the network profitability and thus the rural FTTP coverage. In this paper, we propose a novel agglomerative clustering algorithm. the algorithm together with ilp and heuristic models, attempt to minimise the total fibre cable required to connect sparse rural users to a drop PON splitter located up to several kilometres away from the user. Our results show that proper deployment strategies can increase the use of large last-stage splitter, thus increasing sharing of fibre among users, while still minimising the overall cable length. In addition, we show that our heuristic is able to obtain similar results as the ilp (i.e. within an 8% margin), but can reduce the computation time by about 6 times, for the scenarios we have considered.

关键词： Clustering algorithms Joining processes Layout Minimization Passive optical networks Power cables Roads Clustering algorithms Passive optical networks Power cables layouts Road fiber-to-the-home inductive logic programming Rural Fiber cable computational time Consumers

来源：评论

学校读者我要写书评

暂无评论

24th international Symposium on logic-Based Program Synthesis and Transformation, LOPSTR 2014

24th International Symposium on Logic-Based Program Synthesi...

引用

24th international Symposium on logic-Based Program Synthesis and Transformation, LOPSTR 2014

ISBN: (纸本)9783319178219

the proceedings contain 19 papers. the special focus in this conference is on Program Analysis and Transformation, Constraint Handling Rules, Termination Analysis, Security and Program Testing and Verification. the topics include: Analyzing array manipulating programs by program transformation;analysing and compiling coroutines with abstract conjunctive partial deduction;confluence modulo equivalence in constraint handling rules;exhaustive execution of CHR through source-to-source transformation;a formal semantics for the cognitive architecture ACT-R;chranimation: an animation tool for constraint handling rules;extending the 2D dependency pair framework for conditional term rewriting systems;partial evaluation for java malware detection;access control and obligations in the category-based metamodel;concolic execution and test case generation in prolog;liveness properties in cafeOBJ - a case study for meta-level specifications;a hybrid method for the verification and synthesis of parameterized self-stabilizing protocols;drill and join:;functional kleene closures;on completeness of logic programs;polynomial approximation to well-founded semantics for logic programs with generalized atoms;declarative compilation for constraint logic programming and pre-indexed terms for prolog.

关键词：

来源：评论

学校读者我要写书评

暂无评论

logic-Based Program Synthesis and Transformation 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Maurizio Proietti Hirohisa Seki

ISBN: (数字)9783319178226

ISBN: (纸本)9783319178219

this book constitutes the thoroughly refereed post-conference proceedings of the 24th international Symposium on logic-Based Program Synthesis and Transformation, LOPSTR 2014, held in Canterbury, UK, in September 2014. the 18 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 34 submissions. the aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. the papers are organized along a set of thematic tracks: program analysis and transformation, constraint handling rules, termination analysis, security, program testing and verification, program synthesis, program derivation, semantic issues in logic programming and program transformation and optimization.

关键词： logics and Meanings of Programs Software Engineering/programming and Operating Systems Mathematical logic and Formal Languages Artificial Intelligence Discrete Mathematics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

A Mathematical Benchmark for inductive theorem Provers 24th

A Mathematical Benchmark for Inductive Theorem Provers

引用

24th international conference on logic for programming, Artificial Intelligence and Reasoning, LPAR 2023

作者： Gauthier, thibault Brown, Chad E. Janota, Mikoláš Urban, Josef Czech Technical University in Prague Czech Republic

We present a benchmark of 29687 problems derived from the On-Line Encyclopedia of Integer Sequences (OEIS). Each problem expresses the equivalence of two syntactically different programs generating the same OEIS sequence. Such programs were conjectured by a learning-guided synthesis system using a language with looping operators. the operators implement recursion, and thus many of the proofs require induction on natural numbers. the benchmark contains problems of varying difficulty from a wide area of mathematical domains. We believe that these characteristics will make it an effective judge for the progress of inductive theorem provers in this domain for years to come. © 2023, EasyChair. All rights reserved.

关键词： theorem proving

来源：评论

学校读者我要写书评

暂无评论

DeduDeep: An Extensible Framework for Combining Deep Learning and ASP-Based Models 16th

DeduDeep: An Extensible Framework for Combining Deep Learnin...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Bruno, Pierangela Calimeri, Francesco Marte, Cinzia Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783031157073;9783031157066

In the last decades, Deep Learning (DL)-based approaches have been fruitfully employed in many tasks, such as providing valuable support to computer-aided diagnosis and medicine. However, DL-based approaches are known to suffer from some limitations;for instance, they lack of proper means for providing clear explanations and interpretations of the results, or explicitly including available knowledge to drive decisions. In this work, we present DeduDeep, the prototypical implementation of a framework explicitly conceived with the aim of tackling such limitations by making use of deductive declarative formalisms. In particular, the framework aims at enabling the declarative encoding of explicit knowledge, and, by relying on the use of Answer Set programming (ASP), taking advantage of it for driving decisions taken by neural networks and refining the output. the framework has been tested using different artificial neural networks tailored to semantic segmentation tasks over Laryngeal Endoscopic Images and Freiburg Sitting People Images.

关键词： Answer Set programming Knowledge Representation and Reasoning Non-monotonic reasoning Deep Learning Semantic Segmentation inductive-deductive coupling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：