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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Applying inductive logic programming to process mining

引用

Joint conference of the 17th international conference on inductive logic programming/24th international conference on Machine Learning

作者： Lamma, Evelina Mello, Paola Riguzzi, Fabrizio Storari, Sergio Univ Ferrara ENDIF Via Saragat 1 I-44100 Ferrara Italy Univ Bologna DEIS I-40136 Bologna Italy

ISBN: (纸本)9783540784685

the management of business processes has recently received a lot of attention. One of the most interesting problems is the description of a process model in a language that allows the checking of the compliance of a process execution (or trace) to the model. In this paper we propose a language for the representation of process models that is inspired to the SCIFF language and is an extension of clausal logic. A process model is represented in the language as a set of integrity constraints that allow conjunctive formulas as disjuncts in the head. We present an approach for inducing these models from data: we define a subsumption relation for the integrity constraints, we define a refinement operator and we adapt the algorithm ICL to the problem of learning such formulas. the system has been applied to the problem of inducing the model of a sealed bid auction and of the NetBill protocol. the data used for learning and testing were randomly generated from correct models of the processes.

关键词： process mining learning from interpretations business processes interaction protocols

来源：评论

学校读者我要写书评

暂无评论

Combining logic programming with description logics and machine learning for the semantic web

Combining logic programming with description logics and mach...

引用

3rd international Workshop on Applications of logic programming to the (Semantic) Web and Web Services, ALPSWS 2008 - Co-located with the 24th international conference on logic programming, ICLP 2008

作者： Lisi, Francesca A. Esposito, Floriana Dipartimento di Informatica Università degli Studi di Bari Via E. Orabona 4 70125 Bari Italy

In this paper we consider an extension of logic programming that tackles the SemanticWeb challenge of acquiring rules combined with ontologies. To face this bottleneck problem we propose a framework that resorts to the expressive and deductive power of DL+log and adopts the methodological apparatus of inductive logic programming. © Copyright 2008 front matter by the editors.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

Constructing Markov logic Networks from First-Order Default Rules 1

引用

25th international conference on inductive logic programming (ilp)

作者： Kuzelka, Ondrej Davis, Jesse Schockaert, Steven Cardiff Univ Sch Comp Sci & Informat Cardiff S Glam Wales Katholieke Univ Leuven Dept Comp Sci Leuven Belgium

ISBN: (数字)9783319405667

ISBN: (纸本)9783319405667;9783319405650

Expert knowledge can often be represented using default rules of the form "if A then typically B". In a probabilistic framework, such default rules can be seen as constraints on what should be derivable by MAP-inference. We exploit this idea for constructing a Markov logic network M from a set of first-order default rules D, such that MAP inference from M exactly corresponds to default reasoning from D, where we view first-order default rules as templates for the construction of propositional default rules. In particular, to construct appropriate Markov logic networks, we lift three standard methods for default reasoning. the resulting Markov logic networks could then be refined based on available training data. Our method thus offers a convenient way of using expert knowledge for constraining or guiding the process of learning Markov logic networks.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Extracting rules for successful conditions for artificial insemination in dairy cattle using inductive logic programming 2017

Extracting rules for successful conditions for artificial in...

引用

9th international conference on Machine Learning and Computing, ICMLC 2017

作者： Matsumoto, Atsushi Kubota, Chikara Ohwada, Hayato Department of Industrial Administration Faculty of Science and Technology Tokyo University of Science 2641 Yamazaki Noda Chiba278-8510 Japan Joint Faculty of Veterinary Medicine Laboratory of Theriogenology Kagoshima University 1-24-24 Korimoto Kagoshima Kagoshima890-0065 Japan

ISBN: (纸本)9781450348171

this paper describes a method of pattern extraction to identify successful conditions for artificial insemination in dairy cattle using inductive logic programming. the fertility of lactating dairy cows is economically important but the mean reproductive performance of Holstein cows has declined during the past three decades. the Milk production increases after birth and gradually decreases after several weeks, but it increases again upon the next birth. Increasing the probability of successful artificial insemination is thus economically important. However the success rate of artificial insemination is 20 to 30 %. the amount of progesterone is closely related to the estrus cycle, and can be measured from raw milk. In this study, we extracted variation pattern from time-series data related to dairy cattle including the amount of progesterone using ilp. the success pattern or failure patterns for artificial insemination extracted by the ilp system can be used for decision making on artificial insemination. © 2017 ACM.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Learning relational options for inductive transfer in relational reinforcement learning

引用

Joint conference of the 17th international conference on inductive logic programming/24th international conference on Machine Learning

作者： Croonenborghs, Tom Driessens, Kurt Bruynooghe, Maurice Katholieke Univ Leuven Dept Comp Sci B-3001 Heverlee Belgium

ISBN: (纸本)9783540784685

In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent usually has very little information. therefore, when faced with complex problems that have a large state space, learning a good strategy might be infeasible or too slow to work in practice. One way to overcome this problem, is the use of guidance to supply the agent with traces of "reasonable policies". However, in a lot of cases it will be hard for the user to supply such a policy. In this paper, we will investigate the use of transfer learning in Relational Reinforcement Learning. the goal of transfer learning is to accelerate learning on a target task after training on a different, but related, source task. More specifically, we introduce an extension of the options framework to the relational setting and show how one can learn skills that can be transferred across similar, but different domains. We present experiments showing the possible benefits of using relational options for transfer learning.

关键词： relational reinforcement learning transfer learning options

来源：评论

学校读者我要写书评

暂无评论

Computational logic — CL 2000 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： John Lloyd Veronica Dahl Ulrich Furbach Manfred Kerber Kung-Kiu Lau Catuscia Palamidessi Luís Moniz Pereira Yehoshua Sagiv Peter J. Stuckey

ISBN: (数字)9783540449577

ISBN: (纸本)9783540677970

these are the proceedings of the First international conference on Compu- tional logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. the theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. the conference was collocated with the following events: { 6th international conference on Rules and Objects in Databases (DOOD 2000) { 10th international Workshop on logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th international conference on inductive logic programming (ilp 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { logic programming: theory and Extensions { Constraints { Automated Deduction: Putting theory into Practice { Knowledge Representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { logic programming: Implementations and Applications. the LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. the acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream.

关键词： Artificial Intelligence Software Engineering/programming and Operating Systems Computer System Implementation Mathematical logic and Formal Languages logics and Meanings of Programs programming Techniques

来源：评论

学校读者我要写书评

暂无评论

Relational data clustering for the structuring of television stream 14

Relational data clustering for the structuring of television...

引用

14e Journees internationales Francophones sur l'Extraction et la Gestion des Connaissances, EGC 2014 - 14th international French-Speaking conference on Knowledge Extraction and Management, EGC 2014

作者： Claveau, Vincent Gros, Patrick IRISA - CNRS Campus de Beaulieu RennesF-35042 France INRIA Rennes Campus de Beaulieu RennesF-35042 France

ISBN: (纸本)9782705688417

the goal of automatic structuring of TV stream is to restore a complete and accurate program guide. Most approaches are supervised: they require large quantities of manually annotated data, but also to know a priori the different types of broadcasts (commercials, trailers, programs, sponsors..). To avoid these constraints, we propose to replace this step by an unsupervised classification. the multi-relational nature of our data prohibits the use of usual clustering techniques based attribute-value representations. thus, we propose a clustering technique capable of handling the data. We divert inductive logic programming (ilp) to work unsupervised in this context and show the validity of the approach through different experiments.

关键词： inductive logic programming (ilp)

来源：评论

学校读者我要写书评

暂无评论

targetDP: an Abstraction of Lattice Based Parallelism with Portable Performance 16

targetDP: an Abstraction of Lattice Based Parallelism with P...

引用

16th IEEE international conference on High Performance Computing and Communications HPCC 2014\11th IEEE international conference on Embedded Software and Systems ICESS 2014\6th international Symposium on Cyberspace Safety and Security CSS 2014

作者： Gray, Alan Stratford, Kevin Univ Edinburgh EPCC Edinburgh EH9 3JZ Midlothian Scotland

ISBN: (纸本)9781479961238

To achieve high performance on modern computers, it is vital to map algorithmic parallelism to that inherent in the hardware. From an application developer's perspective, it is also important that code can be maintained in a portable manner across a range of hardware. Here we present targetDP (target Data Parallel), a lightweight programming layer that allows the abstraction of data parallelism for applications that employ structured grids. A single source code may be used to target both thread level parallelism (TLP) and instruction level parallelism (ilp) on either SIMD multi-core CPUs or GPU-accelerated platforms. targetDP is implemented via standard C preprocessor macros and library functions, can be added to existing applications incrementally, and can be combined with higher-level paradigms such as MPI. We present CPU and GPU performance results for a benchmark taken from the lattice Boltzmann application that motivated this work. these demonstrate not only performance portability, but also the optimisation resulting from the intelligent exposure of ilp.

关键词： Synclitism data parallel parallelism crystal lattices Abstraction inductive logic programming central processing units Source code message passing mannose phosphate isomerase remote procedure calls library function BENCHMARKS HIGH-PERFORMANCE Codes

来源：评论

学校读者我要写书评

暂无评论

Survivable Lightpath Provisioning in Multi-Domain Optical Networks 15

Survivable Lightpath Provisioning in Multi-Domain Optical Ne...

引用

15th IEEE international conference on High Performance Switching and Routing (HPSR)

作者： Pavarangkoon, Praphan Oki, Eiji Univ Electrocommun Dept Commun Engn & Informat Tokyo Japan

ISBN: (纸本)9781479916337

this paper proposes a survivable lightpath provisioning scheme that allows traffic splitting in multi-domain optical networks to minimize the cumulative cost of a set of paths. the proposed scheme, called two-phase lightpath provisioning, employs an integer linear programming (ilp) formulation based on hierarchical path computation with full-mesh topology abstraction. there are two phases in the scheme. the first phase solves the ilp problem on an inter-domain topology and then feeds the results as intra-domain requests. the second phase solves the ilp problem in each related domain. Finally, we concatenate all the intra-domain solutions along routing sequences. three different protection strategies are considered with varying degrees of primary and backup route separation. Furthermore, to support various types of traffic demands, we investigate two cases in terms of the number of requested wavelengths. First, the number of requested wavelengths is less than link wavelength capacity. Second, the number of requested wavelengths is greater than link wavelength capacity. For the latter case, the proposed scheme allows traffic splitting among feasible primary and backup routes. the proposed scheme well supports the implementation of heuristic algorithms for lightpath provisioning since it can provide reference values, including upper and lower bounds, that are useful as benchmarks.

关键词： Abstracts Network topology Optical fiber networks Routing Routing protocols Scalability Topology Fiber optic networks Routing protocols Network routing Network topology topology optical paths Scalability Traffic wavelengths inductive logic programming provisioning multiple domain networks

来源：评论

学校读者我要写书评

暂无评论

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

24th International Conference on Logic for Programming, Arti...

引用

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

the proceedings contain 27 papers. the special focus in this conference is on logic for programming, Artificial Intelligence and Reasoning. the topics include: Counterfactuals Modulo Temporal logics;an excursion to the border of decidability: between two- and three-variable logic;a Mathematical Benchmark for inductive theorem Provers;SMT Solving over Finite Field Arithmetic;overapproximation of Non-Linear Integer Arithmetic for Smart Contract Verification;A Fast and Accurate ASP Counting Based Network Reliability Estimator;collaborative Inference of Combined Invariants;Analyzing Multiple Conflicts in SAT: An Experimental Evaluation;An Interactive SMT Tactic in Coq using Abductive Reasoning;Experiments on Infinite Model Finding in SMT Solving;embedding Intuitionistic into Classical logic;on the Complexity of Convex and Reverse Convex Prequadratic Constraints;representation, Verification, and Visualization of Tarskian Interpretations for Typed First-order logic;Toward Optimal Radio Colorings of Hypercubes via SAT-solving;cartesian Reachability logic: A Language-Parametric logic for Verifying k-Safety Properties;scalable Probabilistic Routes;logic of Differentiable logics: Towards a Uniform Semantics of DL;model Checking Omega-Regular Hyperproperties with AutoHyperQ;refining Unification with Abstraction;Exploring Partial Models with SCL;trace-based Deductive Verification;How Much Should this Symbol Weigh? A GNN-Advised Clause Selection;guiding an Instantiation Prover with Graph Neural Networks;tighter Abstract Queries in Neural Network Verification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：