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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

293 篇 会议
18 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

229 篇 工学
- 218 篇 计算机科学与技术...
- 109 篇 软件工程
- 23 篇 电气工程
- 15 篇 控制科学与工程
- 14 篇 信息与通信工程
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 建筑学
- 3 篇 交通运输工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 生物工程
- 1 篇 力学（可授工学、理...
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 安全科学与工程
47 篇 理学
- 44 篇 数学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
14 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 3 篇 图书情报与档案管...
7 篇 教育学
- 7 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学

主题

69 篇 logic programmin...
17 篇 answer set progr...
15 篇 inductive logic ...
12 篇 mathematical log...
11 篇 artificial intel...
11 篇 logics and meani...
10 篇 fuzzy logic
10 篇 programming
10 篇 programming lang...
9 篇 software enginee...
9 篇 logic
7 篇 application soft...
7 篇 logic gates
7 篇 inductive logic ...
7 篇 semantics
7 篇 programming tech...
7 篇 system testing
6 篇 software enginee...
6 篇 machine learning
6 篇 algorithm analys...

机构

3 篇 new mexico state...
3 篇 univ calabria ar...
3 篇 tu wien inst log...
3 篇 tech univ dresde...
2 篇 technological ed...
2 篇 univ oxford oxfo...
2 篇 univ nebraska om...
2 篇 univ helsinki de...
2 篇 network operatio...
2 篇 univ freiburg in...
2 篇 inria lille nord...
2 篇 tech univ dortmu...
2 篇 ecole polytech i...
2 篇 univ paris 13 li...
2 篇 univ pisa dept c...
2 篇 tech univ munich...
2 篇 portland state u...
2 篇 univ london impe...
2 篇 katholieke univ ...
1 篇 bolsista do prog...

作者

4 篇 riguzzi fabrizio
4 篇 ricca francesco
3 篇 gaggl sarah alic...
3 篇 kramer stefan
3 篇 page david
3 篇 son tran cao
3 篇 srinivasan ashwi...
3 篇 froehler sebasti...
3 篇 alphonse erick
2 篇 muggleton stephe...
2 篇 giordano laura
2 篇 toivonen h.
2 篇 ong irene m.
2 篇 revoredo k.
2 篇 bellodi elena
2 篇 osmani aomar
2 篇 bryant christoph...
2 篇 ray oliver
2 篇 hutter dieter
2 篇 costa vitor sant...

语言

314 篇 英文
2 篇 中文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=16th International Conference of Inductive Logic Programming"

共 318 条记录，以下是161-170 订阅

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

详细简洁

排序：

On the Containment of Forbidden Patterns Problems

On the Containment of Forbidden Patterns Problems

引用

16th Annual international conference on the Principles and Practice of Constraint programming

作者： Madelaine, Florent IUT Informat LIMOS CNRS UMR 6158 F-63172 Aubiere France

ISBN: (纸本)9783642153952

Forbidden patterns problems are a generalisation of (finite) constraint satisfaction problems which are definable in Feder and Vardi's logic MMSNP [1]. in fact, they are examples of infinite constraint satisfaction problems with nice model theoretic properties introduced by Bodirsky [2]. In previous work [3], we introduced a normal form for these forbidden patterns problems which allowed us to provide an effective characterisation of when a problem is a finite or infinite constraint satisfaction problem. One of the central concepts of this normal form is that of a recolouring. In the presence of a recolouring from a forbidden patterns problem Omega(1) to another forbidden patterns problem Omega(2), containment of Omega(1) in Omega(2) follows. the converse does not hold in general and it remained open whether it did in the case of problems being given in our normal form. In this paper, we prove that this is indeed the case. We also show that the recolouring problem is Pi(p)(2)-harpd and in Sigma(p)(3).

关键词： Constraint Satisfaction Graph Homomorphism logic in Computer Science Monadic Second Order logic Computational Complexity

来源：评论

学校读者我要写书评

暂无评论

Relentful Strategic Reasoning in Alternating-Time Temporal logic

Relentful Strategic Reasoning in Alternating-Time Temporal L...

引用

16th international conference on logic for programming, Artificial Intelligence and Reasoning (LPAR)

作者： Mogavero, Fabio Murano, Aniello Vardi, Moshe Y. Univ Naples Federico II I-80126 Naples Italy Rice Univ Dept Comp Sci Houston TX 77251 USA

ISBN: (纸本)9783642175107

Temporal logics are a well investigated formalism for the specification, verification, and synthesis of reactive systems. Within this family, alternating temporal logic, ATL*, has been introduced as a useful generalization of classical linear- and branching-time temporal logics by allowing temporal operators to be indexed by coalitions of agents. Classically, temporal logics are memoryless: once a path in the computation tree is quantified at a given node, the computation that has led to that node is forgotten. Recently, mCTL* has been defined as a memoryful variant of CTL*, where path quantification is memoryful. In the context of multi-agent planning, memoryful quantification enables agents to "relent" and change their goals and strategies depending on their past history. In this paper, we define mATL*, a memoryful extension of ATL*, in which a formula is satisfied at a certain node of a path by taking into account both the future and the past. We study the expressive power of mATL*, its succinctness, as well as related decision problems. We also investigate the relationship between memoryful quantification and past modalities and show their equivalence. We show that both the memoryful and the past extensions come without any computational price;indeed, we prove that both the satisfiability and the model-checking problems are 2EXPTIME-COMPLETE, as they are for ATL*.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Exact Cover via Satisfiability: An Empirical Study

Exact Cover via Satisfiability: An Empirical Study

引用

16th Annual international conference on the Principles and Practice of Constraint programming

作者： Junttila, Tommi Kaski, Petteri Aalto Univ Dept Informat & Comp Sci POB 15400 FI-00076 Aalto Finland Aalto Univ Helsinki Inst Informat Technol Dept Informat & Comp Sci FI-00076 Aalto Finland

ISBN: (纸本)9783642153952

Many tasks in combinatorial computation admit a natural formulation as instances of the exact cover problem. We observe that the exact cover problem can in turn be compactly translated to the satisfiability (SAT) problem, allowing the basic Davis-Putnam-Logemann-Loveland procedure with no clause learning to linearly simulate backtrack search for exact cover. this SAT-based approach is empirically compared with a widely applied backtrack search algorithm, Knuth's "Dancing Links X" algorithm, on a set of benchmark problems arising in combinatorial enumeration. the experimental results indicate that the current model-counting SAT solvers are in general superior in pruning the search space, but still need to be optimized for running time.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Productivity and Performance: Improving Consumability of Hardware Transactional Memory through a Real-World Case Study

Productivity and Performance: Improving Consumability of Har...

引用

16th international Euro-Par conference on Parallel Processing

作者： Wang, Huayong Ge, Yi Wang, Yanqi Zou, Yao IBM Research China

ISBN: (纸本)9783642152900

Hardware transactional memory (HTM) is a promising technology to improve the productivity of parallel programming. However, a general agreement has not been reached on the consumability of HTM. User experiences indicate that HTM interface is not straightforward to be adopted by programmers to parallelize existing commercial applications, because of the internal limitation of HTM and the difficulties to identify shared variables hidden in the code. In this paper we demonstrate that, with well-designed encapsulation, HTM can deliver good consumability. Based on the study of a typical commercial application in supply chain simulations - GBSE, we develop a general scheduling engine that encapsulates the HTM interface. With the engine, we can convert the sequential program to multi-threaded model without changing any source code for the simulation logic. the time spent on parallelization is reduced from two months to one week, and the performance is close to the manually tuned counterpart with fine-grained locks.

关键词： hardware transactional memory parallel programming discrete event simulation consumability

来源：评论

学校读者我要写书评

暂无评论

inductive logic programming: 16th international conference, ILP 2006, Revised Selected Papers

Inductive Logic Programming: 16th International Conference, ...

引用

16th international conference of inductive logic programming, ILP 2006

ISBN: (纸本)9783540738466

the proceedings contain 36 papers. the topic discussed include: challenges to machine learning: relations between reality and appearance;first-order probabilistic languages: into the unknown;integration of learning and reasoning techniques;injecting life with computers;on the connection between the phase transition of the covering test and the learning success rate;revising probabilistic Prolog programs;inductive logic programming for gene regulation prediction;generalized ordering-search for learning directed probabilistic logical models;extension of the top-down data driven strategy to ILP;learning recursive patterns for biomedical information extraction;towards learning nonrecursive LPADs by transforming them into Bayesian networks;multi-class prediction using stochastic logic programs;structuring natural language data by learning rewriting rules;and an efficient algorithm for computing kernel function defined with anti-unification.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A modular logic approach for P2P networks: A deductive object oriented framework for P2P neworks

A modular logic approach for P2P networks: A deductive objec...

引用

2009 16th international conference on Systems, Signals and Image Processing, IWSSIP 2009

作者： Mitakos, theodoros Almaliotis, Ioannis Technological Educational Institute of Chalkida Chalkida Greece Network Operation Center Technological Educational Institute of Chalkida Chalkida Greece

ISBN: (纸本)9781424445301

this paper presents a deductive object oriented framework that is capable to model P2P networks. the framework is superimposed over a basic language based on modules. A small set of operators are logically defined and semantically justified in terms of the basic logic programming semantics. Nodes in the network correspond to objects that can exchange messages. ©2009 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

An analysis of wireless inductive coupling for High Data Rate biomedical telemetry using a new VHDL n-PSK modulator

An analysis of wireless inductive coupling for High Data Rat...

引用

2009 16th IEEE international conference on Electronics, Circuits and Systems, ICECS 2009

作者： Elamary, Gihad Chester, Graeme Neasham, Jeffery Newcastle University-School of Electrical Electronic and Computer Engineering Newcastle upon Tyne NE1 7RU United Kingdom

ISBN: (纸本)9781424450916

we present in this wor. the analysis, investigation and experimental measurements for a High Data Rate (HDR), modulator design for biodevice telemetry over wireless inductive coupling. that has been achieving by programming a code description and implementation on an FPGA/CLPD. A new VHDL designed n-PSK modulator programmed with VHDL code generates digital BPSK, QPSK and 8PSK signals. However, comparing to the conventional analogue modulators, this type of modulator offer. the flexibility to reconfigure and upgrade. the system has been designed to operate from inductively coupled RF power. Furthermore, we propose a modified a hybrid Class E/F power amplifier system design, working at low radio frequency;in this work it is 135 KHz for modulated RF power with ASK modulator. the minimum magnetic field and powering range oy the reader is considered in detail. the prototype system has been solved and performance simulated by using Matlab/ Simulink and was evaluated by lab measurement. © 2009 IEEE.

关键词： Quadrature phase shift keying

来源：评论

学校读者我要写书评

暂无评论

Induction on Failure: Learning Connected Horn theories

引用

10th international conference on logic programming and Nonmonotonic Reasoning

作者： Kimber, Tim Broda, Krysia Russo, Alessandra Univ London Imperial Coll Sci Technol & Med London SW7 2AZ England

ISBN: (纸本)9783642042379

Several learning systems based on Inverse Entailment (IE) have been proposed, some that compute single clause hypotheses, exemplified by Progol, and others that, produce multiple clauses in response to a single seed example. A common denominator of these systems, is a restricted hypothesis search space, within which each clause must individually explain some example E, or some member of an abductive explanation for E. this paper proposes a new IE approach, called Induction on Failure (IoF), that generalises existing Horn clause learning systems by allowing the computation of hypotheses within a larger search space, namely that of Connected theories. A proof procedure for IoF is proposed that generalises existing IE systems and also resolves Yamamoto's example. A prototype implementation is also described. Finally, a semantics is presented called Connected theory Generalisation, which is proved to extend Kernel Set Subsumption and to include hypotheses constructed within this new IoF approach.

关键词： inductive logic programming Inverse Entailment Abduction

来源：评论

学校读者我要写书评

暂无评论

A Modular logic Approach for P2P Networks: A Deductive Object Oriented Framework for P2P Networks

A Modular Logic Approach for P2P Networks: A Deductive Objec...

引用

international conference on Systems, Signals and Image Processing, IWSSIP

作者： theodoros Mitakos Ioannis Almaliotis Technological Educational Institute of Chalkida Chalkida Greece Network Operation Center Technological Educational Institute of Chalkida Chalkida Greece

关键词： Peer to peer computing logic programming Object oriented modeling Network servers Educational technology Paper technology Joining processes Message passing Video sharing Telephony

来源：评论

学校读者我要写书评

暂无评论

An analysis of wireless inductive coupling for High Data Rate biomedical telemetry using a new VHDL n-PSK modulator

An analysis of wireless inductive coupling for High Data Rat...

引用

IEEE international conference on Electronics, Circuits and Systems (ICECS)

作者： Gihad Elamary Graeme Chester Jeffery Neasham School of Electrical Electronic and Computer engineering University of Newcastle Newcastle-upon-Tyne UK

ISBN: (纸本)9781424450909;9781424450916

We present in this work the analysis, investigation and experimental measurements for a high data rate (HDR), modulator design for biodevice telemetry over wireless inductive coupling. that has been achieving by programming a code description and implementation on an FPGA/CLPD. A new VHDL designed n-PSK modulator programmed with VHDL code generates digital BPSK, QPSK and 8PSK signals. However, comparing to the conventional analogue modulators, this type of modulator offers the flexibility to reconfigure and upgrade. the system has been designed to operate from inductively coupled RF power. Furthermore, we propose a modified a hybrid class E/F power amplifier system design, working at low radio frequency; in this work it is 135 KHz for modulated RF power with ASK modulator. the minimum magnetic field and powering range of the reader is considered in detail. the prototype system has been solved and performance simulated by using Matlab/ Simulink and was evaluated by lab measurement.

关键词： Biomedical telemetry Radio frequency Biomedical measurements Magnetic field measurement Field programmable gate arrays Signal design Digital modulation Modulation coding Signal generators Binary phase shift keying

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：